Late work minimization in a small flexible manufacturing system

Computers and Industrial Engineering

Volumn 52, Issue 2, 2007, Pages 210-228

  Sterna, Malgorzata ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Branch and bound algorithm; Flexible manufacturing system; Late work criterion; Shop scheduling

Indexed keywords

ALGORITHMS; CHUCKING MACHINES; COMPUTATIONAL METHODS; LATHES; MILLING MACHINES; PRODUCTION CONTROL;

BOUND ALGORITHMS; FLEXIBLE MANUFACTURING SYSTEM; LATE WORK CRITERION; SHOP SCHEDULING;

INDUSTRIAL ENGINEERING;

EID: 33847157999     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2006.12.004     Document Type: Article

References (40)

1. Błażewicz J. Scheduling preemptible tasks on parallel processors with information loss. Recherche Technique et Science Informatique 3 6 (1984) 415-420
2. Błażewicz J., Domschke W., and Pesch E. The job shop scheduling problem: conventional and new solution techniques. European Journal of Operational Research 93 (1996) 1-33
3. Błażewicz J., Ecker K., Pesch E., Schmidt G., and We{ogonek}glarz J. Scheduling computer and manufacturing processes. 2nd ed. (2001), Springer, Berlin, Heidelberg, New York
4. Błażewicz J., and Finke G. Minimizing mean weighted execution time loss on identical and uniform processors. Information Processing Letters 24 (1987) 259-263
5. Błażewicz J., Pawlak G., Sterna M., Walter B., and Zawirski M. A heuristic algorithm for schedule optimization in FMS environment. Foundations of Computing and Decision Sciences 24 4 (1999) 189-207
6. Błażewicz J., Pesch E., and Sterna M. A branch and bound algorithm for the job shop scheduling problem. In: Drexl A., and Kimms A. (Eds). Beyond manufacturing resource planning (MRPII) (1998), Springer, Heidelberg 219-254
7. Błażewicz J., Pesch E., Sterna M., and Werner F. Total late work criteria for shop scheduling problems. In: Inderfurth K., Schwödiauer G., Domschke W., Juhnke J., Kleinschmidt P., and Wäscher G. (Eds). Operations research proceedings 1999 (2000), Springer, Berlin 354-359
8. Błażewicz J., Pesch E., Sterna M., and Werner F. Open shop scheduling problems with late work criteria. Discrete Applied Mathematics 134 (2004) 1-24
9. Błażewicz J., Pesch E., Sterna M., and Werner F. Flow shop scheduling with late work criterion - choosing the best solution strategy. Lecture Notes in Computer Science 3285 (2004) 68-75
10. Błażewicz J., Pesch E., Sterna M., and Werner F. The two-machine flow-shop problem with weighted late work criterion and common due date. European Journal of Operational Research 165 2 (2005) 408-415
11. Błażewicz J., Pesch E., Sterna M., and Werner F. Metaheuristics for late work minimization in two-machine flow shop with common due date. Lecture Notes in Artificial Intelligence 3698 (2005) 222-234
12. Błażewicz J., Pesch E., Sterna M., and Werner F. A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. Computers and Industrial Engineering 49 4 (2005) 611-624
13. Błażewicz, J., Pesch, E., Sterna, M., Werner, F. (2007). A note on two-machine job shop with weighted late work criterion. Journal of Scheduling, 10(3), in press.
14. Brucker P. Scheduling algorithms. 2nd ed. (1998), Springer, Berlin, Heidelberg, New York
15. Brucker P., Jurisch B., and Sievers B. A branch and bound algorithm for the job shop scheduling problem. Discrete Applied Mathematics 49 (1994) 107-127
16. Carlier J., and Pinson E. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research 78 (1994) 146-161
17. Chen B., Potts C.N., and Woeginger G.J. A review of machine scheduling. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of combinatorial optimization (1998), Kluwer Academic Publishers, Boston
18. Ciriani T.A., and Leachman R.C. Optimization in industry. Mathematical programming and modelling techniques in practice (1993), John Wiley, New York
19. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 2 (1976) 117-129
20. Garey M.R., and Johnson D.S. Computers and Intractability. A guide to the theory of NP-completeness (1979), W.H. Freeman and Co., San Francisco
21. Hariri A.M.A., Potts C.N., and Van Wassenhove L.N. Single machine scheduling to minimize total late work. INFORMS Journal on Computing 7 (1995) 232-242
22. Haupt R. A survey of priority rule-based scheduling. OR Spektrum 11 (1989) 3-16
23. Hochbaum D.S., and Shamir R. Minimizing the number of tardy job unit under release time constraints. Discrete Applied Mathematics 28 (1990) 45-57
24. Kethley R.B., and Alidaee B. Single machine scheduling to minimize total late work: a comparison of scheduling rules and search algorithms. Computers and Industrial Engineering 43 (2002) 509-528
25. Kovalyov M.Y., Potts C.N., and Van Wasenhove L.N. A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work. Mathematics of Operations Research 19 1 (1994) 86-93
26. Kusiak, A. (Ed.). 1988. Flexible manufacturing systems: methods and studies. Amsterdam: North-Holland.
27. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
28. Leung J.Y.-T., Yu V.K.M., and Wei W.-D. Minimizing the weighted number of tardy task units. Discrete Applied Mathematics 51 (1994) 307-316
29. In: Leung J.Y.-T. (Ed). Handbook of scheduling: algorithms, models, and performance analysis (2004), CRC Press, Boca Raton
30. Pesch E. Learning in automated manufacturing. A local search approach (1994), Physica-Verlag, Heidelberg
31. Pinedo M., and Chao X. Operation scheduling with applications in manufacturing and services (1999), Irwin/McGraw-Hill, Boston
32. Potts C.N., and Van Wassenhove L.N. Single machine scheduling to minimize total late work. Operations Research 40 3 (1991) 586-595
33. Potts C.N., and Van Wassenhove L.N. Approximation algorithms for scheduling a single machine to minimize total late work. Operations Research Letters 11 (1991) 261-266
34. Roy, B., Sussmann, B. (1964). Les problémes d'ordonnancement avec constraintes disjoncties. SEMA Note D.S., 9.
35. Stecke, K. E., Suri. R. (Eds.). (1985). Flexible manufacturing systems: operations research models and applications. Annals of Operations Research, 3.
36. Sterna, M. (2000). Problems and algorithms in non-classical shop scheduling. Ph.D. thesis. Poznań: Scientific Publishers OWN Polish Academy of Sciences.
37. Sterna, M. (2006a). Late work minimization problems. In Extended abstracts of 10th International Workshop on Project Management and Scheduling (pp. 335-341). Poznań: Nakom.
38. Sterna, M. (2006b). Late work scheduling in shop systems. Dissertation 405. Poznań: Publishing House of Poznań University of Technology.
39. Sterna, M. (2006c). Late work minimization in a small manufacturing system. Technical Report, RA-02/06. Poznań: Institute of Computing Science, Poznań University of Technology.
40. Sterna, M. (2007). Dominance relations for two-machine flow shop problem with late work criterion. Bulletin of the Polish Academy of Sciences. Technical Sciences, 55(1), in press.