Campaign planning in time-indexed model formulations

International Journal of Production Research

Volumn 43, Issue 1, 2005, Pages 49-66

  Suerie, C ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Batch production; Campaign production; Integer programming; Lot sizing; Process industries

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

LOT-SIZING MODELS; MODEL FORMULATION; PRODUCTION PLANNING;

PRODUCTION ENGINEERING;

EID: 27844524492     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540412331285823     Document Type: Article

References (24)

1. Belvaux, G. and Wolsey, L. A., Modelling practical lot-sizing problems as mixed-integer programs. Manag. Sci., 2001, 47, 993-1007.
2. Dash Optimization, Xpress-Optimizer Reference Manual, 2002 (Dash Optimization: Blisworth).
3. Drexl, A. and Haase, K., Proportional lotsizing and scheduling. Int. J. Prod. Econ., 1995, 40, 73-87.
4. Fisher, M., Ramdas, K. and Zheng, Y.-S., Ending inventory valuation in multiperiod production scheduling. Manag. Sci., 2001, 47, 679-692.
5. Fleischmann, B., The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res., 1990, 44, 337-348.
6. Giannelos, N. F. and Georgiadis, M. C., A novel event-driven formulation for short-term scheduling of multipurpose continuous processes. Ind. Eng. Chem. Res., 2002, 41, 2431-2439.
7. Gopalakrishnan, M., Miller, D. M. and Schmidt, C. P., A framework for modelling set-up carryover in the capacitated lotsizing problem. Int. J. Prod. Res., 1995, 33, 1973-1988.
8. Haase, K., Lotsizing and Scheduling for Production Planning, 1994 (Springer: Berlin).
9. Heuts, R. M. J., Seidel, H. P. and Selen, W. J., A comparison of two lot sizing-sequencing heuristics for the process industry. Eur. J. Oper. Res., 1992, 59, 413-424.
10. Hui, C.-W. and Gupta, A., A bi-index continuous-time mixed-integer linear programming model for single-stage batch scheduling with parallel units. Ind. Eng. Chem. Res., 2001, 40, 5960-5967.
11. Ierapetritou, M. G., Mené, T. S. and Floudas, C. A., Effective continuous-time formulation for short-term scheduling. 3. Multiple intermediate due dates. Ind. Eng. Chem. Res., 1999, 38, 3446-3461.
12. Kallrath, J., Planning and scheduling in the process industry. OR Spect., 2002, 24, 219-250.
13. Kallrath, J., The concept of contiguity in models based on time-indexed formulations, in Scientific Computing in Chemical Engineering II, edited by F. Keil, W. Mackens and J. Werther, pp. 330-337, 1999 (Springer: Berlin).
14. Kondili, E., Pantelides, C. C. and Sargent, R. W. H., A general algorithm for short-term scheduling of batch operations - I. MILP formulation. Comput. Chem. Eng. 1993, 17, 211-227.
15. Lee, Y. M. and Chen, E. J., BASF uses a framework for developing web-based production-planning-optimization tools. Interfaces, 2002, 32(6), 15-24.
16. Lee, K.-H., Heo, S.-K., Lee, H.-K. and Lee, I.-B., Scheduling of single-stage and continuous processes on parallel lines with intermediate due dates. Ind. Eng. Chem. Res., 2002, 41, 58-66.
17. Lee, K.-H., Park, H. I. and Lee, I.-B., A novel nonuniform discrete time formulation for short-term scheduling of batch and continuous processes. Ind. Eng. Chem. Res., 2001, 40, 4902-4911.
18. Pochet, Y. and Wolsey, L. A., Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Prog. 1994, 67, 297-323.
19. Salomon, M., Deterministic Lotsizing Models for Production Planning, 1991 (Springer: Berlin).
20. Stadtler, H., Improved rolling schedules for the dynamic single-level lot-sizing problem. Manag. Sci., 2000, 46, 318-326.
21. Suerie, C. and Stadtler, H., The capacitated lot-sizing problem with linked lot-sizes. Manag. Sci., 2003, 49, 1039-1054.
22. Timpe, C., Solving planning and scheduling problems with combined integer and constraint programming. OR Spect., 2002, 24, 431-448.
23. Trigeiro, W. W., Thomas, L. J. and McClain, J. O., Capacitated lotsizing with set-up times. Manag. Sci., 1989, 35, 353-366.
24. Wolsey, L. A., Integer Programming, 1998 (Wiley: New York).