Improved algorithm for single machine scheduling with release dates

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

This paper considered the single machine scheduling problem with unequal release dates so as to minimize total completion times. This problem was proved to be as an NP-hard problem. Traditional heuristics for the problem were analyzed, and then we presented an improved algorithm. A numerical example and its computational result were given. The performance of the algorithm was also analyzed by experiments and the experimental results show that the algorithm is more effective than the existing heuristics.

Original languageEnglish
Pages (from-to)929-932
Number of pages4
JournalZhongguo Jixie Gongcheng/China Mechanical Engineering
Volume19
Issue number8
StatePublished - 25 Apr 2008

Keywords

  • Heuristic algorithm
  • Release date
  • Single machine scheduling
  • Total completion times

Fingerprint

Dive into the research topics of 'Improved algorithm for single machine scheduling with release dates'. Together they form a unique fingerprint.

Cite this