Production planning problem with sequence dependent setups as a bilevel programming problem

European Journal of Operational Research

Volumn 187, Issue 3, 2008, Pages 1504-1512

  Lukač, Zrinka ^a   Šorić, Kristina ^a   Rosenzweig, Višnja Vojvodić ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Bilevel mixed 0 1 integer programming problem; Heuristics based on tabu search; Production; Sequence dependent setup times; Two machines

Indexed keywords

COST EFFECTIVENESS; DATA STORAGE EQUIPMENT; HEURISTIC METHODS; INTEGER PROGRAMMING; TABU SEARCH;

BILEVEL; SEQUENCE DEPENDENT SETUP TIMES; TOTAL SEQUENCE;

PRODUCTION CONTROL;

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

References (15)

1. Allahverdi A., Gupta J.N.D., and Aldowaisan T. A review of scheduling research involving setup consideration. Omega, The International Journal of Management Science 27 (1999) 219-239
2. Ben-Ayed O., and Blair C.E. Computational difficulties of bilevel linear programming. Technical Notes (1989) 556-560
3. Bitran G.R., and Yanasse H.H. Computational complexity of the capacitated lot size problem. Management Science 28 (1982) 1174-1186
4. Cao D., and Chen M. Capacitated plant selection in a decentralized manufacturing environment: A bilevel optimization approach. European Journal of Operational Research 169 (2006) 97-110
5. Drexl A., and Kimms A. Lot sizing and scheduling - survey and extensions. European Journal of Operational Research 99 (1997) 221-235
6. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
7. Gupta D., and Magnusson T. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers and Operations Research 32 (2005) 727-747
8. Hung Y., Chen C., Shih C., and Hung M. Using tabu search with ranking candidate list to solve production planning problems with setups. Computers and Industrial Engineering 45 (2003) 615-634
9. Karimi B., Fatemi Ghomi S.M.T., and Wilson J.M. The capacitated lot sizing problem: a review of models and algorithms. Omega, The International Journal of Management Science 31 (2003) 365-378
10. Moore J.T., and Bard J.F. The mixed integer linear bilevel programming problem. Operations research 38 (1990) 911-921
11. Sumichrast R.T. Scheduling parallel processors to minimize setup time. Computers and Operations Research 14 (1987) 305-313
12. Vicente L., and Calamai P. Bilevel and multilevel programming: A bibliography review. Journal of Global Optimization 5 (1994) 291-306
13. Vicente L., Savard G., and Judice J. Discrete linear bilevel programming problem. Journal of Optimization Theory and Application 89 (1996) 597-614
14. Wen P., and Huang D. A simple Tabu search method to solve the mixed integer linear bilevel program. European Journal of Operational Research 88 (1996) 354-362
15. Wolsey L.A. MIP modelling of changeovers in production planning and scheduling problems. European Journal of Operational Research 99 (1997) 154-165