Paper Info
Title
Minimizing Maximum Lateness in a Two-Machine Open Shop
Abstract
We consider the problem of scheduling independent jobs in a two-machine open shop so as to minimize the maximum lateness with respect to due dates for the jobs. For the case in which preemption is allowed, a linear-time algorithm is presented. For the nonpreemptive case, NP-hardness is established.
Year
DOI
Venue
1981
10.1287/moor.6.1.153
Math. Oper. Res.
Keywords
DocType
Volume
maximum lateness,preemptive scheduling,linear-time algorithm,np-hardness,due dates,nonpreemptive scheduling,two-machine open shop
Journal
6
Issue
ISSN
Citations 
1
0364-765X
24
PageRank 
References 
Authors
8.29
2
3
Name
Order
Citations
PageRank
E. L. Lawler11102585.42
J. K. Lenstra21689329.39
A. H. G. Rinnooy Kan32109497.45