Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

Journal of Heuristics

Volumn 13, Issue 4, 2007, Pages 337-358

  De Araujo, Silvio A ^a   Arenales, Marcos N ^b   Clark, Alistair R ^c  

^a SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

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

Author keywords

Fix and relax; Local search; Lot sizing; Scheduling; Sequence dependent setup costs and times

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; MATERIALS SCIENCE;

LOCAL SEARCH; MIXED INTEGER PROGRAMMING (MIP); SEQUENCE DEPENDENT SETUP COSTS AND TIMES;

SCHEDULING;

EID: 34547145422     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-007-9011-9     Document Type: Article

References (35)

1. Aarts, E.H.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley, Chichester (1997)
2. Araujo, S.A., Arenales, M.N., Clark, A.R.: A Lot-sizing and furnace scheduling in small market-driven foundries. Comput. Oper. Res. (2007, in press)
3. Arosio, M., Sianesi, A.: A heuristic algorithm for master production scheduling generation with finite capacity and sequence dependent setups. Int. J. Prod. Res. 31, 531-553 (1993)
4. Belvaux, G., Wolsey, L.A.: Modelling practical lot-sizing problems as mixed integer programs. Manag. Sci. 47, 993-1007 (2001)
5. Beraldi, P., Ghianib, G., Guerrieroc, E., Grieco, A.: Scenario-based planning for lot-sizing and scheduling with uncertain processing times. Int. J. Prod. Econ. 101(1), 140-149 (2006)
6. Clark, A.R.: Optimization approximations for capacity constrained material requirements planning problems. Int. J. Prod. Econ. 84, 115-131 (2003a)
7. Clark, A.R.: Hybrid heuristics for planning lot sizes and setups. Comput. Ind. Eng. 45, 545-562 (2003b)
8. Clark, A.R.: Rolling horizon heuristics for production and setup planning with backlogs and error-prone demand forecasts. Prod. Plan. Control 16, 81-97 (2005)
9. Diaz, A., Glover, F., Ghaziri, H.M., González, J.L., Laguna, M., Moscato, P., Tseng, F.T., Optimización Heurística y Redes Neuronales. Editorial Paraninfo, Spain (1996)
10. Dillenberger, C., Escudero, L.F., Wollensak, A., Zhang, W.: On practical resource allocation for production planning and scheduling with period overlapping setups. Eur. J. Oper. Res. 75, 275-286 (1994)
11. Drexl, A., Kimms, A.: Lot sizing and scheduling-survey and extensions. Eur. J. Oper. Res. 99, 221-235 (1997)
12. Dumoulin, A., Vercellis, C.: Tactical models for hierarchical capacitated lot-sizing problems with setups and changeovers. Int. J. Prod. Res. 38, 51-67 (2000)
13. Eglese, R.W.: Simulated annealing: a tool for operational research. Eur. J. Oper. Res. 46, 271-281 (1990)
14. Fleischmann, B., Meyr, H.: The general lotsizing and scheduling problem. Oper. Res. Spectr. 19, 11-21 (1997)
15. Ghosh Dastidar, S., Nagi, R.: Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. Comput. Oper. Res. 32, 2987-3005 (2005)
16. Glover, F.W., Kochenberger, G.A. (eds.): Handbook of Metaheuristics. Kluwer Academic, Boston (2003)
17. Gopalakrishnan, M., Miller, D.M., Schmidt, C.P.: A framework for modelling setup carryover in the capacitated lot-sizing problem. Int. J. Prod. Res. 33, 1973-1988 (1995)
18. Gupta, D., Magnusson, T.: The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Comput. Oper. Res. 32, 727-747 (2005)
19. Haase, K., Kimms, A.: Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities. Int. J. Prod. Econ. 66, 159-169 (2000)
20. ILOG: Cplex 7.1 User's manual. ILOG SA BP 85 9 Rue de Verdun 94253. Gentilly, France. http://www.ilog.com (2001)
21. Karimi, B., Fatemi Ghomi, S.M.T., Wilson, J.M.: The capacitated lot sizing problem: a review of models and algorithms. Omega 31, 365-378 (2003)
22. Kelly, J.D., Mann, J.L.: Flowsheet decomposition heuristic for scheduling: a relax-and-fix method. Comput. Chem. Eng. 28, 2193-2200 (2004)
23. Kuik, R., van Wassenhove, L.N., Maes, J.: Linear programming, simulated annealing and tabu search heuristics for lotsizing in bottleneck assembly systems. IIE Trans. 25(1), 62-72 (1993)
24. Meyr, H.: Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. Eur. J. Oper. Res. 120, 311-326 (2000)
25. Meyr, H.: Simultaneous lotsizing and scheduling on parallel machines. Eur. J. Oper. Res. 139, 277-292 (2002)
26. Porkka, P., Vepsalainen, A.P.J., Kuula, M.: Multiperiod production planning carrying over set-up time. Int. J. Prod. Res. 41, 1133-1148 (2003)
27. Ovacik, I.M., Uzsoy, R.: Rolling horizon procedures for dynamic parallel machine scheduling with sequence dependent setup time. Int. J. Prod. Res. 33, 3173-3192 (1995)
28. Santos-Meza, E., Santos, M.O., Arenales, M.N.: Lot-sizing problem in an automated foundry. Eur. J. Oper. Res. 139, 490-500 (2002)
29. Smith-Daniels, V.L., Ritzman, L.P.: A model for lot sizing and sequencing in process industries. Int. J. Prod. Res. 26, 647-674 (1988)
30. Smith-Daniels, V.L., Smith-Daniels, D.E.: A mixed integer programming model for lot sizing and sequencing packaging lines in the process industries. IIE Trans. 18, 278-285 (1986)
31. Stadtler, H.: Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows. Oper. Res. 51, 487-502 (2003)
32. Suerie, C., Stadtler, H.: The capacitated lot-sizing problem with linked lot-sizes. Manag. Sci. 49, 1039-1054 (2003)
33. Teghem, J., Pirlot, M., Antoniadis, C.: Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem. J. Comput. Appl. Math. 64, 91-102 (1995)
34. Wolsey, L.A., Integer Programming. Wiley, New York (1998)
35. Wolsey, L.A.: Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Manag. Sci. 48, 1587-1602 (2002)