Scheduling equal processing time jobs to minimize the weighted number of late jobs

Journal of Mathematical Modelling and Algorithms

Volumn 5, Issue 2, 2006, Pages 143-165

  Brucker, Peter ^a   Kravchenko, Svetlana A ^b  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

^b UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

Jobs with equal processing times; NP hardness; Parallel machine scheduling; Polynomial algorithm; Preemption

Indexed keywords

EID: 33646896732     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1007/s10852-005-9011-4     Document Type: Conference Paper

References (5)

1. Brucker, P.: Scheduling algorithms. Springer, Berlin Heidelberg New York Tokyo, 1998.
2. Brucker, P., Jurisch, B. and Jurisch, M.; Open shop problems with unit time operations, Math. Methods Oper. Res. 37 (1993), 59-73.
3. Brucker, P., Kravchenko, S. A. and Sotskov, Y. N.: Preemptive job-shop scheduling problem with a fixed number of jobs, Math. Methods Oper. Res. 49 (1999), 41-76.
4. Garey, M. R. and Johnson, D. S.: Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco, 1979.
5. Lawler, E. L.: Resent results in the theory of machine scheduling, in A. Bachem, M. Grötschel and B. Korte (eds.), Mathematical Programming: the State of the Art, Springer, Berlin Heidelberg New York Tokyo, 1983, pp. 202-234.