Premium
Open shop scheduling to minimize the number of late jobs
Author(s) -
Koulamas Christos,
Kyparisis George J.
Publication year - 1998
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199808)45:5<525::aid-nav6>3.0.co;2-5
Subject(s) - open shop , job shop scheduling , open shop scheduling , computer science , scheduling (production processes) , mathematical optimization , flow shop scheduling , due date , operations research , mathematics , operating system , schedule
We develop polynomial algorithms for several cases of the NP‐hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are ordered. For the m machine common due date problem, we assume that one machine is maximal and impose a restriction on its load. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 525–532, 1998