Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Journal of Scheduling

Volumn 14, Issue 2, 2011, Pages 209-219

  Menezes, António Aroso ^a,b   Clark, Alistair ^b   Almada Lobo, Bernardo ^a  

^a UNIVERSITY OF PORTO   (Portugal)

^b UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

Integer programming; Lot sizing and scheduling; Nontriangular setups; Setup crossover

Indexed keywords

CAPACITATED LOT SIZING; LOT SIZING; MIXED-INTEGER PROGRAMMING; NONTRIANGULAR SETUPS; OPTIMAL SOLUTIONS; PRODUCTION PLANNING; PRODUCTION SEQUENCES; SCHEDULING MODELS; SCHEDULING PROBLEM; SEQUENCE-DEPENDENT; SEQUENCE-DEPENDENT SETUP TIME; SET-UP TIME; SETUP CROSSOVER; SINGLE PERIOD;

INTEGER PROGRAMMING; PRODUCTION CONTROL; PRODUCTION ENGINEERING;

SCHEDULING;

EID: 79958772189     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-010-0197-6     Document Type: Article

References (21)

1. Almada-Lobo, B., Klabjan, D., Oliveira, J. F., & Carravilla, M. A. (2007). Single machine multi-product capacitated lot sizing with sequence-dependent setups. International Journal of Production Research, 45(20), 4873-4894. (Pubitemid 47352796)
2. Balas, E. (1989). The prize collecting traveling salesman problem. Networks, 19(6), 621-636.
3. Clark, A. R., & Clark, S. J. (2000). Rolling-horizon lot-sizing when setup times are sequence-dependent. International Journal of Production Research, 38(10), 2287-2307. (Pubitemid 35401851)
4. Drexl, A., & Kimms, A. (1997). Lot sizing and scheduling - survey and extensions. European Journal of Operational Research, 99(2), 221-235. (Pubitemid 127418431)
5. Fleischmann, B. (1994). The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. European Journal of Operational Research, 75(2), 395-404.
6. Fleischmann, B., & Meyr, H. (1997). The general lotsizing and scheduling problem. OR Spektrum, 19, 11-21.
7. Gopalakrishnan, M. (2000). A modified framework for modelling setup carry over in the capacitated lotsizing problem. International Journal of Production Research, 38(14), 3421-3424. (Pubitemid 35401966)
8. Gopalakrishnan, M., Miller, D. M., & Schmidt, C. P. (1995). A framework for modelling setup carryover in the capacitated lot sizing problem. International Journal of Production Research, 33(7), 1973-1988.
9. Haase, K. (1996). Capacitated lot-sizing with sequence dependent setup costs. OR Spektrum, 18, 51-59.
10. Haase, K., & Kimms, A. (2000). Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics, 66, 159-169.
11. Instances (2009). URL http://paginas.fe.up.pt/~balobo/NonTriangular- Setups.
12. Laporte, G. (1992a). The travelling salesman problem: an overview of exact and approximated algorithms. European Journal of Operational Research, 59(2), 231-248.
13. Laporte, G. (1992b). The vehicle routing problem: an overview of exact and approximated algorithms. European Journal of Operational Research, 59(2), 345-358.
14. Porkka, P., & Kuula, A. P. J. V. M. (2000). A modified framework for modelling set-up carryover in the capacitated lotsizing problem. International Journal of Production Research, 38(14), 3421-3424.
15. Sox, C. R., & Gao, Y. (1999). The capacitated lot sizing problem with setup carry-over. IIE Transactions, 31(2), 173-181.
16. Suerie, C. (2006). Modeling of period overlapping setup times. European Journal of Operational Research, 174(2), 874-886. (Pubitemid 44109942)
17. Suerie, C., & Stadtler, H. (2003). The capacitated lot-sizing problem with linked lot sizes. Management Science, 49(8), 1039-1054.
18. Sung, C., & Maravelias, C. T. (2008). A mixed-integer programming formulation for the general capacitated lot-sizing problem. Computers & Chemical Engineering, 32, 244-259. (Pubitemid 350016257)
19. Toso, E. A. V., & Morabito, R. (2005). Otimização no dimensionamento e seqüenciamento de lotes de produção: Estudo de caso numa fábrica de rações. Gestão e Produção, 12(2), 203-217.
20. Wolsey, L. (2002). Solving multi-item lot-sizing problems with an mip solver using classification and reformulation. Management Science, 48(12), 1587-1602.
21. Zhu, X. Y., & Wilhelm, W. E. (2006). Scheduling and lot sizing with sequence-dependent setup: a literature review. IIE Transactions, 38(11), 987-1007. (Pubitemid 44355862)