A note on the two machine job shop with the weighted late work criterion

Journal of Scheduling

Volumn 10, Issue 2, 2007, Pages 87-95

  Blazewicz, Jacek ^a   Pesch, Erwin ^b   Sterna, Małgorzata ^a   Werner, Frank ^c  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF SIEGEN   (Germany)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Dynamic programming; Job shop scheduling problem; Late work criterion; Scheduling

Indexed keywords

JOB SHOP SCHEDULING PROBLEMS; LATE WORK CRITERION; PSEUDOPOLYNOMIAL TIME METHOD; WORK PERFORMANCE;

ESTIMATION; JOB ANALYSIS; POLYNOMIALS; QUALITY ASSURANCE; WORK SIMPLIFICATION;

DYNAMIC PROGRAMMING;

EID: 33847252582     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-006-0005-5     Document Type: Article

References (15)

1. Blazewicz, J., "Scheduling preemptible tasks on parallel processors with information loss," Recherche Technique et Science Informatiques, 3(6), 415-420 (1984).
2. Blazewicz, J., K. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes. 2nd edn. Springer, Berlin, Heidelberg, New York, 2001.
3. Blazewicz, J. and G. Finke, "Minimizing mean weighted execution time loss on identical and uniform processors," Information Processing Letters, 24, 259-263 (1987).
4. Blazewicz, J., E. Pesch, M. Sterna, and F. Werner, "Open shop scheduling problems with late work criteria," Discrete Applied Mathematics, 134, 1-24 (2004).
5. Blazewicz, J., E. Pesch, M. Sterna, and F. Werner, "The two-machine flow-shop problem with weighted late work criterion and common due date," European Journal of Operational Research, 165(2), 408-415 (2005).
6. Brucker, P., Scheduling Algorithms. 2nd edn. Springer, Berlin, Heidelberg, New York, 1998.
7. Garey, M. R. and D. S. Johnson, Computers and Intractability. W.H. Freeman and Co., San Francisco (1979).
8. Jackson, J. R., "An extension of Johnson's results on job shop scheduling," Naval Research Logistics Quarterly, 3, 201-203 (1956).
9. Johnson, S. M., "Optimal two- and three-stage production schedules with setup times included," Naval Research Logistics Quarterly, 1, 61-68 (1954).
10. Jozefowska, J., B. Jurisch, and W. Kubiak, "Scheduling shops to minimize the weighted number of late jobs," Operation Research Letters, 16(5), 277-283 (1994).
11. Leung, J. Y. T., "Minim izing total weighted error for imprecise computation tasks and related problems," in: J. Y. T. Leung (ed.), Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton, 2004; Chapter 34:1-16.
12. Pinedo, M. and X. Chao, Operation Scheduling with Applications in Manufacturing and Services. Irwin/McGraw-Hill, Boston (1999).
13. Potts, C. N. and L. N. van Wassenhove, "Single machine scheduling to minimize total late work," Operations Research, 40(3), 586-595 (1991).
14. Sterna, M., Problems and Algorithms in Non-Classical Shop Scheduling. Scientific Publishers of the Polish Academy of Sciences, Poznan (2000).
15. Sterna, M., Late Work Scheduling in Shop Systems. Publishing House of Poznan University of Technology, Poznan (2006).