A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs

European Journal of Operational Research

Volumn 187, Issue 3, 2008, Pages 1100-1114

  Monkman, Susan K ^a   Morrice, Douglas J ^b   Bard, Jonathan F ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b NAVAL POSTGRADUATE SCHOOL   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

GRASP; Product families; Production scheduling; Sequence dependant setup costs; Traveling salesman subtour problem

Indexed keywords

COSTS; HEURISTIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION CONTROL; SCHEDULING;

GRASP; PRODUCT FAMILIES; PRODUCTION SCHEDULING; SETUP COSTS; TRAVELING SALESMAN SUBTOUR PROBLEM;

ELECTRONIC EQUIPMENT MANUFACTURE;

EID: 36849008762     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.06.063     Document Type: Article

References (18)

1. Agnetis A., Alfieri A., and Nicosia G. A heuristic approach to batching and scheduling a single machine to minimize setup costs. Computers & Industrial Engineering 46 (2004) 793-802
2. Al-Fawzan M.A., and Al-Sultan K.S. A tabu search based algorithm for minimizing the number of tool switches on a flexible machine. Computers & Industrial Engineering 44 (2002) 35-47
3. Allahverdi A., Gupta J.N.D., and Aldowaisan T. A review of scheduling research involving setup considerations. Omega, The International Journal of Management Science 27 (1999) 219-239
4. Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y., in press. A survey of scheduling problems with setup times or costs. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.060.
5. Balakrishnan A., and Vanderbeck F. A tactical planning model for mixed-model electronics assembly operations. Operations Research 47 3 (1999) 395-409
6. Baptiste P., and Le Pape C. Scheduling a single machine to minimize a regular objective function under setup constraints. Discrete Optimization 2 (2005) 83-99
7. Crama Y., and van de Klundert J. Worst-case performance approximation algorithms for tool management problems. Naval Research Logistics 46 (1999) 445-462
8. Feo T.A., and Bard J.F. Flight scheduling and maintenance base planning. Management Science 35 12 (1989) 1415-1432
9. Feo T.A., and Resende M.G.C. Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-134
10. Feo T.A., Venkatraman K., and Bard J.F. A GRASP for a difficult single machine scheduling problem. Computers & Operations Research 18 8 (1991) 635-643
11. Laporte G., Riera-Ledesma J., and Salazar-González J.J. A branch-and-cut algorithm for the undirected traveling purchaser problem. Operations Research 51 6 (2003) 940-951
12. Liu C.Y., and Chang S.C. Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Transactions on Robotics and Automation 16 (2000) 408-419
13. Loveland, J.L., Monkman S.K., Morrice, D.J., in press. Dell uses new production scheduling heuristics to accommodate increased product variety. Interfaces.
14. Miller D.M., Chen H.C., Matson J., and Liu Q. A hybrid genetic algorithm for the single machine scheduling problem. Journal of Heuristics 5 (1999) 437-454
15. Mittenthal J., and Noon C.E. An insert/delete heuristic for the traveling salesman subset-tour problem with one additional constraint. Journal of the Operational Research Society 33 3 (1992) 277-283
16. Pinto J.M., and Grossmann I.E. Assignment and sequencing models for the scheduling of process systems. Annals of Operations Research 81 (1998) 433-466
17. Renaud J., and Boctor F.F. An efficient composite heuristic for the symmetric generalized traveling salesman problem. European Journal of Operations Research 108 (1998) 571-584
18. Vignier A., Sonntag B., and Portmann M.C. Hybrid method for a parallel-machine scheduling problem. IEEE Symposium on Emerging Technologies and Factory Automation, ETFA 1 (1999) 671-678