Optimal and heuristic solutions for a scheduling problem arising in a foundry

Computers and Operations Research

Volumn 32, Issue 9, 2005, Pages 2351-2382

  Nonås, Sigrid Lise ^a,b   Olsen, Kai A ^a,c  

^a UNIVERSITY OF BERGEN   (Norway)

^b NORWEGIAN SCHOOL OF ECONOMICS   (Norway)

^c Faculty of Economics   (Norway)

Author keywords

Order acceptance; Production scheduling

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FOUNDRIES; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; PRODUCTION CONTROL; STRATEGIC PLANNING;

ORDER ACCEPTANCE; PRODUCTION SCHEDULING; SCHEDULING PROBLEMS;

SCHEDULING;

EID: 12244256133     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.03.007     Document Type: Article

References (17)

1. Baker K.R. Introduction to sequencing and scheduling. 1974;Wiley, New York
2. French S. Sequencing and scheduling: an introduction to the mathematics of the job-shop. 1982;Ellis Horwood Limited, England
3. Gargeya V.B., Deane R.H. Scheduling research in multiple resource constrained job shops. a review and critique International Journal of Production Research. 34(8):1996;2077-2097
4. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. Sequencing and scheduling: algorithms and complexity. Graves S.C., Rinnooy Kan A.H.G., Zipkin P.H. Logistics of production and inventory. 1993;Elsevier, The Netherlands
5. Du J., Leung J.Y.T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operation Research. 15(3):1990;483-495
6. Koulamas C. The total tardiness problem - review and extensions. Operations Research. 42(6):1994;1025-1041
7. Potts C.P., Van Wassenhove L.N. A decomposition algorithm for the single machine total tardiness problem. Operation Research Letters. 1:1982;177-181
8. Garey M.R., Johnson D.S., Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operation Research. 1:1976;117-129
9. Armentano V.A., Scrich C.R. Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics. 63(2):2000;131-140
10. Wang T.Y., Wu K.B. A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems. International Journal of Systems Science. 31(4):2000;537-542
11. Wang T.Y., Wu K.B. A parameter set design procedure for the simulated annealing algorithm under the computational time constraint. Computers and Operations Research. 26(7):1999;665-678
12. Fredendall L.D., Melnyk S.A., Ragatz G. Information and scheduling in a dual resource constrained job shop. International Journal of Production Research. 34(10):1996;2783-2802
13. Kantorovich L.V. Mathematical methods of organizing and planning production. Management Science. 6:1960;366-422
14. Haessler R.W., Sweeney P.E. Cutting stock problems and solution procedures. European Journal of Operational Research. 54:1991;141-150
15. Mieghem J.V., Rudi N. Newsvendor networks. dynamic inventory management and capacity investment with discretionary pooling Manufacturing and Service Operations Management. 4(4):2002;313-335
16. Nahmias S. Production and operations analysis. 1997;Mc-Graw Hill, Singapore
17. Carr NG. IT doesn't matter. Harward Business Review 2003; May: 41-9.