Scheduling with a common due-window: Polynomially solvable cases

Gur Mosheiov, Assaf Sarig*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

The single machine scheduling problem to minimize maximum weighted absolute deviations of job completion times from a common due-date, is known to be NP-hard. However, two special cases have been shown to have polynomial time solutions: the case of unit processing time jobs, and the case of due-date assignment for a given job sequence. We extend both cases to a setting of a common due-window. We show that the unit-job problem includes 12 different sub-cases, depending on the size and location of the (given) due-window. Scheduling and due-window assignment for a given job sequence is solved for a single machine, for parallel identical machines and for flow-shops. For each of the above cases, an appropriate special-structured linear program is presented.

Original languageAmerican English
Pages (from-to)1492-1505
Number of pages14
JournalInformation Sciences
Volume180
Issue number8
DOIs
StatePublished - 15 Apr 2010

Keywords

  • Common due-window
  • Earliness-tardiness cost
  • Linear programming
  • Scheduling

Fingerprint

Dive into the research topics of 'Scheduling with a common due-window: Polynomially solvable cases'. Together they form a unique fingerprint.

Cite this