Single machine scheduling to minimize the number of early and tardy jobs

Avital Lann*, Gur Mosheiov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

66 Scopus citations

Abstract

We study single machine scheduling problems with the objective of minimizing the number of early and tardy jobs. Several cost structures are considered: job-independent, job-dependent and symmetric, and job-dependent and asymmetric. The first two problem-classes are shown to be polynomially solvable, whereas the latter is shown to be NP-hard, and heuristic solution methods are introduced. An extensive numerical study tests the performance of the proposed algorithms. Finally, separate treatment is given to the pre-emptive versions of the above models.

Original languageAmerican English
Pages (from-to)769-781
Number of pages13
JournalComputers and Operations Research
Volume23
Issue number8
DOIs
StatePublished - Aug 1996

Fingerprint

Dive into the research topics of 'Single machine scheduling to minimize the number of early and tardy jobs'. Together they form a unique fingerprint.

Cite this