TY - JOUR
T1 - Single machine scheduling to minimize the number of early and tardy jobs
AU - Lann, Avital
AU - Mosheiov, Gur
PY - 1996/8
Y1 - 1996/8
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0030212987&partnerID=8YFLogxK
U2 - 10.1016/0305-0548(95)00078-X
DO - 10.1016/0305-0548(95)00078-X
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0030212987
SN - 0305-0548
VL - 23
SP - 769
EP - 781
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 8
ER -