A hybrid general lot-sizing and scheduling formulation for a production process with a two-stage product structure

International Journal of Production Research

Volumn 49, Issue 9, 2011, Pages 2463-2480

  Transchel, Sandra ^a   Minner, Stefan ^b   Kallrath, Josef ^c   Lohndorf, Nils ^b   Eberhard, Ulrich ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF VIENNA   (Austria)

^c BASF SE   (Germany)

Author keywords

lot sizing; mixed integer programming; process industry; reformulations; scheduling

Indexed keywords

COMPLEX APPLICATIONS; COMPUTATION TIME; CONTINUOUS TIME; HOLDING COSTS; INTEGRALITY GAPS; LOT SIZING; LOT-SIZE; MANUFACTURING PROCESS; MIXED-INTEGER PROGRAMMING; MODEL-BASED; MULTI-PRODUCTS; NUMERICAL STUDIES; OPTIMISATIONS; PENALTY COST; PROCESS INDUSTRIES; PRODUCT STRUCTURE; PRODUCTION PROCESS; REFORMULATIONS; SCHEDULING PROBLEM; SECOND LEVEL; SEQUENCE DEPENDENT SETUPS; SEQUENCING PROBLEMS; TRANSPORTATION PROBLEM; TWO STAGE;

INDUSTRY; LINEAR PROGRAMMING; OPTIMIZATION; PRODUCTION CONTROL; PRODUCTION ENGINEERING; SCHEDULING;

INTEGER PROGRAMMING;

EID: 79951815554     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.532910     Document Type: Article

References (31)

1. Burman, M.H. and Gershwin, S.B., 1996. A real-time dynamic lot-sizing heuristic for a manufacturing system subject to random setup times. International Journal of Production Research, 34 (6), 1625-1641. (Pubitemid 126519772)
2. Chen, V.C.P., et al., 2006. A review on design, modeling and applications of computer experiments. IIE Transactions, 38 (4), 273-291.
3. Clark, A.R. and Clark, J.S., 2000. Rolling-horizon lot-sizing when set-up times are sequencedependent. International Journal of Production Research, 38 (10), 2287-2307. (Pubitemid 35401851)
4. Clark, A.R. and Clark, J.S., 2010. Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching. Journal of Scheduling, 13 (2), 111-121.
5. Denizel, M. and Sural, H., 2006. On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times. Journal of the Operational Research Society, 57 (4), 389-399.
6. Drexl, A. and Kimms, A., 1997. Lot sizing and scheduling-survey and extensions. European Journal of Operational Research, 99 (2), 221-235.
7. Eppen, G.D. and Martin, R.K., 1987. Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations Research, 35 (6), 832-848. (Pubitemid 18608631)
8. Fleischmann, B., 1994. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. European Journal of Operational Research, 75 (2), 395-404.
9. Fleischmann, B. and Meyr, H., 1997. The general lotsizing and scheduling problem. OR Spectrum, 19 (1), 11-21.
10. Floudas, C.A. and Lin, X., 2004. Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review. Computers and ChemicalEngineering, 28, 2109-2129. (Pubitemid 39094063)
11. Grosso, A., Jamali, A.R.M.J.U., and Locatelli, M., 2009. Finding maximin latin hypercube designs by iterated local search heuristics. European Journal of Operational Research, 197 (2), 541-547.
12. Gunther, H.-O. and Van Beek, P., 2003. Advanced planning and scheduling in process industry. In: H.-O. Gunther and P. Van Beek, ed. Advancedplanning andscheduling solutions inprocess industry. Berlin: Springer, 1-9.
13. Jans, R.F. and Degraeve, Z., 2008. Modeling industrial lot sizing problems: A review. International Journal of Production Research, 46 (6), 1619-1643. (Pubitemid 350161679)
14. Jordan, C. and Drexl, A., 1998. Discrete lotsizing and scheduling by batch sequencing. Management Science, 44 (5), 698-713. (Pubitemid 128596874)
15. Kallrath, J., 2002. Planning and scheduling in the process industry. OR Spectrum, 24 (3), 219-250.
16. Karimi, B., Fatemi Ghomi, S.M.T., and Wilson, J.M., 2003. The capacitated lot sizing problem: a review of models and algorithms. Omega, 31 (5), 365-378. (Pubitemid 37007074)
17. Kimms, A. and Motta Toledo, C.F., 2003. Bottling coca-cola soft drinks. Technicalreport. Freiberg: Technical University Bergakademie.
18. Koclar, A., 2005. The general lot sizing andschedulingproblem with sequence dependent changeovers. Master thesis. Middle East Technical University.
19. Koclar, A. and Sural, H., 2005. A note on The general lot sizing and scheduling problem. OR Spectrum, 27 (1), 145-146. (Pubitemid 40389676)
20. Krarup, J. and Bilde, O., 1977. Plant location, set covering and economic lotsizing: an O(mn) algorithm for structured problems. In: L. Collatz, et al., ed. Optimierung bei Graphentheoretischen und Ganzzahligen Problemen. Basel: Birkhauser, 150-180.
21. Lasdon, L.S. and Terjung, R.C., 1971. An efficient algorithm for multi-item scheduling. Operations Research, 19 (4), 946-969.
22. Lasserre, J.B., 1992. An integrated model for job-shop planning and scheduling. Management Science, 38 (8), 1201-1211.
23. Meyr, H., 2000. Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. European Journal of Operational Research, 120 (2), 311-326. (Pubitemid 30542650)
24. Meyr, H., 2002. Simultaneous lotsizing and scheduling on parallel machines. European Journal of OperationalResearch, 139 (2), 277-292. (Pubitemid 34201239)
25. Pochet, Y. and Wolsey, L.A., 2006. Production planning by mixed integer programming (Springer Series in Operations Research andFinancialEngineering). Secaucus, NJ, USA: Springer-Verlag New York, Inc.
26. Rosling, K., 1986. Optimal lot sizing for dynamic assembly systems. In: S. Axsater, C. Schneeweiss and E. Silver, ed. Multi-Stage Production Planning and Inventory Control. Heidelberg: Springer, 119-131.
27. Salomon, M., et al., 1997. Solving the discrete lotsizing and scheduling problem with sequence dependent setup costs and set-up times using the travelling salesman problem with time windows. European Journal of Operational Research, 100 (3), 494-513. (Pubitemid 127392373)
28. Stadtler, H., 1996. Mixed integer programming model formulations for dynamic multiitem multilevel capacitated lotsizing. European Journal of Operational Research, 94 (3), 561-581. (Pubitemid 126391962)
29. Surie, C., 2005. Time continuity in discrete time models. Berlin: Springer.
30. Surie, C. and Stadtler, H., 2003. The capacitated lot-sizing problem with linked lot sizes. Management Science, 49 (8), 1039-1054.
31. Tempelmeier, H. and Buschkuhl, L., 2008. Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource. International Journal of Production Economics, 113 (1), 401-412. (Pubitemid 351467151)