Open shop scheduling to minimize the number of late jobs
针对NP难的开放车间调度问题，利用开放车间最大完工时间问题的最新结果，为最小化延迟工件数的若干情形开发了多项式算法。
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