Multitask and multistage production planning and scheduling for process industries

Operations Research

Volumn 56, Issue 4, 2008, Pages 1010-1025

  Gaglioppa, Francesco ^a   Miller, Lisa A ^a   Benjaafar, Saif ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BATCH MANUFACTURING; CHEMICAL MANUFACTURING; COMPUTATIONAL EFFORTS; END PRODUCTS; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATIONS; MIXED-INTEGER LINEAR PROGRAMS; MULTIPLE SEQUENCES; MULTISTAGE PRODUCTIONS; OIL REFINING; OPTIMALITY; PLANNING AND SCHEDULING; PROCESS INDUSTRIES; VALID INEQUALITIES;

DYNAMIC PROGRAMMING; FOOD PROCESSING; LINEAR PROGRAMMING; LINEARIZATION; PARTICLE SIZE ANALYSIS; PETROLEUM REFINING; PLANNING; PRODUCTION CONTROL; PRODUCTION ENGINEERING; REFINING; SCHEDULING;

INTEGER PROGRAMMING;

EID: 61349161801     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0525     Document Type: Article

References (43)

1. Afentakis, P., B. Gavish. 1986. Optimal lot-sizing algorithms for complex product structures. Oper: Res. 34(2) 237-249.
2. Applequist, G., O. Samikoglu, J. Pekny, G. Reklaitis. 1997. Issues in the use, design and evolution of process scheduling and planning systems. ISA Trans. 36(2) 81-121.
3. Arkin, E., D. Joneja, R. Roundy. 1989. Computational complexity of uncapacited multi-echelon production planning problems. Oper. Res. Lett. 8(2) 61-66.
4. Atamtürk, A., J. C. Muñoz. 2004. A study of the lot-sizing polytope. Math. Programming 99(3, Ser. A) 443-465.
5. Barany, I., T. J. V. Roy, L. A. Wolsey. 1984. Strong formulations for multiitem, capacitated lot sizing. Management Sci. 30(10) 1255-1261.
6. Belvaux, G., L. A. Wolsey. 2000. bc-prod: A specialized branch-and-cut system, for lot-sizing problems. Management Sci. 46 724-738.
7. Belvaux, G., L. A. Wolsey. 2001. Modelling practical lot-sizing problems as mixed-integer programs. Management Sci. 47(7) 993-1007.
8. Bitran, G., H. Yanasse. 1982. Computational complexity of the capacitated lot size problem. Management Sci. 28 1174-1185.
9. Clark, A., H. Scarf. 1960. Optimal policies for a multi-echelon inventory problem. Management Sci. 6 475-490.
10. Constantino, M. 1996. A cutting plane approach to capacitated lot-sizing with start-up cost. Math. Programming 75 353-376.
11. Elkamel, A., M. Zentner, J. Pekny, G. Reklaitis. 1997. A decomposition heuristic for scheduling the general batch chemical plant. Engrg. Opt. 28(4) 299-330.
12. Florian, M., J. K. Lenstra, A. H. G. Rinnooy Kan. 1980. Deterministic production planning: Algorithms and complexity. Management Sci. 26 669-679.
13. Ierapetritou, M., C. Floudas. 1998. Effective continuous-time formulation for short-term, scheduling. 1. Multipurpose batch processes. Indust. Engrg. Chemistry Res. 37 4341-4359.
14. Kallrath, J. 2003. Planning and scheduling in the process industry. H. O. Gunther, P. van Beek, eds. Advanced Planning and Scheduling Solutions in Process Industry. Springer-Verlag, Berlin, 201-227.
15. Karmarkar, U., K. Rajaram. 2001. Grade selection and blending to optimize cost and quality. Oper: Res. 49(2) 271-280.
16. Karmarkar, U., L. Schrage. 1985. The deterministic dynamic product cycling problem. Oper. Res. 33(2) 326-345.
17. Katok, E., H. S. Lewis, T. P. Harrison. 1998. Lot-sizing in general assembly systems with setup costs, setup times, and multiple constrained resources. Management Sci. 44(6) 859-877.
18. Kondili, E., C. C. Pantelides, R. W. H. Sargent. 1993. A general algorithm for short-term scheduling of batch operations - 1.MILP formulation. Comp. Chemical Engrg. 17 211-227.
19. Lin, X., C. Floudas, S. Modi. 2002. Continuous-time optimization approach for medium-range production scheduling of a multiproduct batch plant. Indust. Engrg. Chemistry Res. 41 3884-3906.
20. Magnanti, T. L., R. Vachani. 1990. A strong cutting plane for production scheduling with changeover costs. Oper. Res. 38(3) 456-473.
21. Majozi, T., X. X. Zhu. 2001. A novel continuous-time MILP formulation for multipurpose batch plants. 1. Short-term scheduling. Indust. Engrg. Chemistry Res. 40(25) 5935-5949.
22. Maravelias, C. T., I. Grossman. 2003a. New general continuous-time state-task network formulation for short-term scheduling of multipurpose batch plants. Indust. Engrg. Chemistry Res. 42 3056-3074.
23. Maravelias, C. T., I. Grossman. 2003b. Minimization of the makespan with a discrete-time state-task network formulation. Indust. Engrg. Chemistry Res. 42 6252-6257.
24. Miller, A. J., L. A. Wolsey. 2003. Tight MIP formulations for multi-item discrete lot sizing problems. Oper: Res. 51(4) 557-605.
25. Miller, A. J., G. L. Nemhauser, M. W. P. Savelsbergh. 2003. A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case. Math. Programming 95(1) 71-90.
26. Mockus, L., G. V. Reklaitis. 1999. Continuous time representation approach to batch and continuous process scheduling. 1.MINLP formulation. Indust. Engrg. Chemistry Res. 38(1) 197-203.
27. Neumann, K., C. Schwindt, N. Trautmann. 2003. Advanced production scheduling for batch plants in process industries. H. O. Gunther, P. van Beek, eds. Advanced Planning and Scheduling Solutions in Process Industry. Springer-Verlag, Berlin, 43-71.
28. Pantelides, C. C. 1994. Unified frameworks for the optimal process planning and scheduling. Proc. Conf. Comput. Aided Process Oper: (FOCAPO), Cache Publications, New York, 253-274.
29. Papageorgiou, L. G., C. C. Pantelides. 1996a. Optimal campaign planning/scheduling of multipurpose batch/semicontinuous plants. 1. Mathematical formulation. Indust. Engrg. Chemistry Res. 35 488-509.
30. Papageorgiou, L. G., C. C. Pantelides. 1996b. Optimal campaign planning/scheduling of multipurpose batch/semicontinuous plants. 2. Computational issues. Indust. Engrg. Chemistry Res. 35 510-529.
31. Pekny, J. F. 2002. Algorithm architectures to support large-scale process systems engineering applications involving combinatorics, uncertainty, and risk management. Comput. Chemical Engrg. 26 239-267.
32. Pochet, Y., L. A. Wolsey. 1991. Multi-item lot-sizing problems using strong cutting planes. Management Sci. 37 53-67.
33. Sahinidis, N. V., I. E. Grossman. 1991. Reformulation of multiperiod MILP models for planning and scheduling of chemical processes. Comp. Chemical Engrg. 15(4) 255-272.
34. Schilling, G., C. C. Pantelides. 1996. A simple continuous-time process scheduling formulation and a novel solution algorithm. Comput. Chemical Engrg. 20(4) S1221-S1226.
35. Shah, N. 1998. Single- and multisite planning and scheduling: Current status and future challenges. AICHE Sympos. Ser: 94(320) 75-90.
36. Shah, N., C. C. Pantelides, R. W. H. Sargent. 1993. A general algorithm for short-term scheduling of batch operations - II. Computational issues. Comput. Chemical Engrg. 17 229-244.
37. Stadtler, H. 2003. Multilevel lot-sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper: Res. 51(3) 487-502.
38. Tempelmeier, H., M. Destroff. 1996. A Lagrangean-based heuristic for dynamic multilevel multiitem. constrained lot-sizing in general assembly systems with setup times. Management Sci. 42(5) 738-757.
39. van den Heever, S. A., I. Grossman. 1999. Disjunctive multiperiod optimization methods for design and planning of chemical process systems. Comput. Chemical Engrg. 23(3) 1075-1095.
40. Wolsey, L. A. 1997. MIP modelling of changeovers in production planning and scheduling problems. Eur: J. Oper. Res. 99 154-165.
41. Wolsey, L. A. 2002. Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Management Sci. 48(12) 1587-1602.
42. Zhang, X., R. W. H. Sargent. 1996. The optimal operation of mixed production facilities-A general formulation and some approaches for the solution. Comput. Chemical Engrg. 20(6-7) 897-904.
43. Zipkin, P. H. 2000. Foundations of Inventory Management. McGraw-Hill, New York.