Production planning problem with sequence dependent setups as a bilevel programming problem
DOI10.1016/j.ejor.2006.09.029zbMath1146.90390OpenAlexW2056304719MaRDI QIDQ2467304
Višnja Vojvodić Rosenzweig, Kristina Šorić, Zrinka Lukač
Publication date: 21 January 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.029
productionsequence dependent setup timestwo machinesbilevel mixed 0-1 integer programming problemheuristics based on tabu search
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (10)
Cites Work
- Unnamed Item
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- Lot sizing and scheduling -- survey and extensions
- MIP modelling of changeovers in production planning and scheduling problems
- Bilevel and multilevel programming: A bibliography review
- Scheduling parallel processors to minimize setup time
- Discrete linear bilevel programming problem
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- Computational Difficulties of Bilevel Linear Programming
- Computational Complexity of the Capacitated Lot Size Problem
- The Mixed Integer Linear Bilevel Programming Problem
This page was built for publication: Production planning problem with sequence dependent setups as a bilevel programming problem