Modeling and managing uncertainty in process planning and scheduling

Springer Optimization and Its Applications

Volumn 30, Issue , 2009, Pages 97-144

  Ierapetritou, Marianthi ^a   Li, Zukui ^a  

^a The State University of New Jersey   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976496732     PISSN: 19316828     EISSN: 19316836     Source Type: Book Series    
DOI: 10.1007/978-0-387-88617-6_3     Document Type: Chapter

References (120)

1. J. Acevedo and E.N. Pistikopoulos. A multiparametric programming approach for linear process engineering problems under uncertainty. Industrial and Engineering Chemistry Research, 36:717-728, 1997.
2. D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Computational Geometry, 8:295-313, 1992.
3. H. Aytug, M.A. Lawley, K.McKay, S.Mohan, and R. Uzsoy. Executing production schedules in the face of uncertainties: A review and some future directions. European Journal of Operational Research, 161(1):86-110, 2005.
4. J. Balasubramanian and I.E. Grossmann. A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times. Computers and Chemical Engineering, 26:41-57, 2002.
5. J. Balasubramanian and I.E. Grossmann. Scheduling optimization under uncertainty - an alternative approach. Computers and Chemical Engineering, 27(4):469-490, 2003.
6. J. Balasubramanian and I.E. Grossmann. Approximation to multistage stochastic optimization in multiperiod batch plant scheduling under demand uncertainty. Industrial and Engineering Chemistry Research, 43(14):3695- 3713, 2004.
7. M.H. Bassett, J.F. Pekny, and G.V. Reklaitis. Decomposition techniques for the solution of large-scale scheduling problems. AIChE Journal, 42:3373-3387, 1996.
8. M.H. Bassett, J.F. Pekny, and G.V. Reklaitis. Using detailed scheduling to obtain realistic operating policies for a batch processing facility. Industrial and Engineering Chemistry Research, 36:1717-1726, 1997.
9. A. Bemporad, M. Morari, V. Dua, and E.N. Pistikopoulos. The explicit linear quadratic regulator for constrained systems. Automatica, 38(1):3-20, 2002.
10. A. Ben-Tal and A. Nemirovski. Robust solutions to uncertain programs. Operations Research Letters, 25:1-13, 1999.
11. D. Bertsimas and M. Sim. Robust discrete optimization and network flows. Mathematic Progress, 98:49-71, 2003.
12. O. Bilde and J. Krarup. Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics, 1: 79-97, 1977.
13. D.B. Birewar and I.E. Grossmann. Simultaneous production planning and scheduling in multiproduct batch plants. Industrial and Engineering Chemistry Research, 29(4):570-580, 1990.
14. A. Bonfill, M. Bagajewicz, A. Espuna, and L. Puigjaner. Risk management in the scheduling of batch plants under uncertain market demand. Industrial and Engineering Chemistry Research, 43(3):741-750, 2004.
15. A. Bonfill, A. Espuna, and L. Puigjaner. Addressing robustness in scheduling batch processes with uncertain operation times. Industrial and Engineering Chemistry Research, 44(5):1524-1534, 2005.
16. E. Borrelli, A. Bemporad, and M. Morari. A geometric algorithm for multiparametric linear programming. Journal of Optimization Theory and Applications, 118:515-540, 2003.
17. S. Bose and J. Pekny. A model predictive framework for planning and scheduling problems: a case study of consumer goods supply chain. Computers and Chemical Engineering, 24:329-335, 2000.
18. P. Castro, A. Barbosa-Povoa, and H. Matos. Optimal periodic scheduling of batch plants using rtn-based discrete and continuous-time formulations: A case study approach. Industrial and Engineering Chemistry Research, 42:3346- 3360, 2003.
19. L. Churh and R. Uzsoy. Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Computer Integrated Manufacturing, 5:153-163, 1992.
20. A.R. Conn, K. Scheinberg, and P.L. Toint On the convergence of derivativefree methods for unconstrained optimization. In Invited Presentation at the Powellfest, Report 96/10, Cambridge, 1996.
21. B.J. Cott and S. Macchietto. Minimizing the effects of batch process variability using online schedule modification. Computers and Chemical Engineering, 13:105-113, 1989.
22. H. Crowder. Computational Improvements for Subgradient Optimization, volume XIX of Symposia Mathematica. Academic Press, London, 1976.
23. R.L. Daniels and P. Kouvelis. Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Science, 41:363- 376, 1995.
24. G.B. Dantzig. Linear programming under uncertainty. Management Science, 1:197-206, 1955.
25. M. Diaby, H.C. Bahl, M.H. Karwan, and S. Zionts. A lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Science, 9:1329, 1992.
26. A.D. Dimitriadis, N. Shah, and C.C. Pantelides. Rtn-based rolling horizon algorithms for medium term scheduling of multipurpose plants. Computers and Chemical Engineering, 21:S1061-S1066, 1997.Suppl. S.
27. V. Dua and E.N. Pistikopoulos. An outer-approximation algorithm for the solution of multiparametric minlp problems. Computers and Chemical Engineering, 22:S955 - S958, 1998.
28. V. Dua and E.N. Pistikopoulos. Algorithms for the solution of multiparametric mixed-integer nonlinear optimization problems. Industrial and Engineering Chemistry Research, 38:3976 - 3987, 1999.
29. L. El-Ghaoui, F. Oustry, and H. Lebret. Robust solutions to uncertain semidefinite programs. SIAM Journal of Optimization, 9:33-52, 1998.
30. A. Elkamel, M. Zentner, J.F. Pekny, and G.V. Reklaitis. A decomposition heuristic for scheduling the general batch chemical plant. Engineering Optimization, 28(4):299-330, 1997.
31. L. Equi, G. Giorgio, S. Marziale, and A. Weintraub. A combined transportation an scheduling problem. European Journal of Operational Research, 97: 94, 1997.
32. D. Erlenkotter. A dual-based procedure for uncapacitated facility location. Operational Research, 26(1):992-1009, 1978.
33. L. Escudero, F.J. Quintana, and J. Salmeron. A modeling and an algorithmic framework for oil supply, transformation and distribution optimization under uncertainty. European Journal of Operational Research, 114:638-656, 1999.
34. L.F. Escudero, P.V. Kamesan, A.J. King, and R.J-B. Wets. Production planning via scenario modeling. Annals of Operations Research, 43:311- 335, 1993.
35. M.L. Fisher. Optimal solution of scheduling problems using lagrange multipliers: Part i. Operational Research, 21:1114-1127, 1973.
36. M.L. Fisher and D.S. Hochbaum. Database location in a computer network. Journ. ACM, 27(718-735), 1980.
37. M.L. Fisher and P. Kedia. Optimal solution of set covering/partitioning problems using dual heuristics. Management Science, 39(67-88), 1990.
38. C.A. Floudas and X. Lin. Continuous-time versus discrete-time approaches for scheduling of chemical processes: A review. Computers and Chemical Engineering, 28:2109-2129, 2004.
39. K. Fukuda and A. Prodon. Double description method revisited. In M. Deza, R. Euler, and I. manoussakis, editors, Combinatorics and Computer Science, volume 1120 of Lecture Notes in Computer Science, pages 91-111. Springer-Verlag, 1996.
40. T. Gal. Postoptimal Analyses, Parametric Programming and Related Topics. deGruyter, 2 edition, 1995.
41. A.M. Geoffrion. Lagrangean relaxation and its uses in integer programming. Mathematic Programmatic Studies, 2:82, 1974.
42. V. Goel and I.E. Grossmann. A stochastic programming approach to planning of offshore gas field developments under uncertainty in reserves. Computers and Chemical Engineering, 28:1409-1429, 2004.
43. S.C. Graves. Using lagrangean techniques to solve hierarchical production planning problems. Management Science, 28:260, 1982.
44. M. Guignard. Lagrangean relaxation: A short course. Belgian Journal of Operational Research, 35(3-4):95, 1995.
45. M. Guignard. Lagrangean relaxation. Top, 11(2):151-228, 2003.
46. M. Guignard and S. Kim. Lagrangean decomposition: A model yielding stronger lagrangean bounds. Mathematic Programing, 39:215, 1987.
47. M. Guignard and M.B. Rosenwein. An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Networks, 20:345-359, 1990.
48. F. Guinand, A. Moukrim, and E. Sanlaville. Sensitivity analysis of tree scheduling on two machines with communication delays. Parallel Computing, 30(1):103-120, 2004.
49. A. Gupta and C.D. Maranas. A hierarchical lagrangean relaxation procedure for solving midterm planning problem. Industrial and Engineering Chemistry Research, 38:1937, 1999.
50. N.G. Hall and M.E. Posner. Sensitivity analysis for scheduling problems. Journal of Scheduling, 7(1):49-83, 2004.
51. I. Harjunkoski and I.E. Grossmann. A decomposition approach for the scheduling of a steel plant production. Computers and Chemical Engineering, 25(11-12):1647-1660, 2001.
52. S.A.V.D. Heever and I.E. Grossmann. Disjunctive multiperiod optimization methods for design and planning of chemical process systems. Computers and Chemical Engineering, 23:1075-1095, 1999.
53. M. Held and R.M. Karp. The traveling salesman problem and minimum spanning trees. Operational Research, 18:1138-1162, 1970.
54. T.S. Hene, V. Dua, and E.N. Pistikopoulos. A hybrid parametric/stochastic programming approach for mixed- integer nonlinear problems under uncertainty. Industrial and Engineering Chemistry Research, 41:67-77, 2002.
55. S.J. Honkomp, L. Mockus, and G.V. Reklaitis. Robust scheduling with processing time uncertainty. Computers and Chemical Engineering, 21(1):S1055- S1060, 1997.
56. S.J. Honkomp, L. Mockus, and G.V. Reklaitis. A framework for schedule evaluation with processing uncertainty. Computers and Chemical Engineering, 23:595-609, 1999.
57. A. Huercio, A. Espuna, and L. Puigjaner. Incorporating on-line scheduling strategies in integrated batch production control. Computers and Chemical Engineering, 19:S609-S615, 1995.
58. M.G. Ierapetritou and C.A. Floudas. Effective continuous-time formulation for short-term scheduling. 1. multipurpose batch processes. Industrial and Engineering Chemistry Research, 37(11):4341-4359, 1998.
59. M.G. Ierapetritou, T.S. Hene, and C.A. Floudas. Effective continuous-time formulation for short-term scheduling. 3. multiple intermediate due dates. Industrial and Engineering Chemistry Research, 38(9):3446-3461, 1999.
60. M.G. Ierapetritou and E.N. Pistikopoulos. Batch plant design and operations under uncertainty. Industrial and Engineering Chemistry Research, 35(3): 772-787, 1996.
61. S.S. Isukapalli. Uncertainty Analysis of Transport-Transformation Models. PhD thesis, Rutgers University, 1999.
62. Z. Jia and M.G. Ierapetritou. Short-term scheduling under uncertainty using MILP sensitivity analysis. Industrial and Engineering Chemistry Research, 43:3782, 2004.
63. Z. Jia and M.G. Ierapetritou. Uncertainty analysis on the right-hand-side for MILP problems. AIChE Journal, 52:2486, 2006.
64. Z. Jia and M.G. Ierapetritou. Generate pareto optimal solutions of scheduling problems using normal boundary intersection technique. Computers and Chemical Engineering, 31(4):268-280, 2007.
65. K.B. Kanakamedala, G.V. Reklaitis, and V. Venkatasubramanian. Reactive schedule modification in multipurpose batch chemical plants. Industrial and Engineering Chemistry Research, 30:77-90, 1994.
66. S. Karabuk and I. Sabuncuoglu. Rescheduling frequency in an fms with uncertain processing times and unreliable machines. Research Report, pages IEOR-9704, 1997.
67. J.E. Kelley. The cutting-plane method for solving convex programs. Journal SIAM, 8:703-712, 1960.
68. E. Kondili, C.C. Pantelides, and R.W.H. Sargent. A general algorithm for short-term scheduling of batch operations. i. MILP formulation. Computers and Chemical Engineering, 17:211-227, 1993.
69. P. Kouvelis, R.L. Daniels, and G. Vairaktarakis. Robust scheduling of a twomachine flow shop with uncertain processing times. IIE Trans, 32:421-432, 2000.
70. M. Laguna. Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty. Management Science, 44:S101-S110, 1998.
71. C. Lemarechal. An algorithm for minimizing convex functions. In Proceedings IFIP'74 Congress, pages 552-556. North Holland, 1974.
72. Z. Li and Marianthi G. Ierapetritou. Process scheduling under uncertainty using multiparametric programming. AIChE Journal, 53:3183-3203, 2007.
73. X. Lin, S.L. Janak, and C.A. Floudas. A new robust optimization approach for scheduling under uncertainty: I. bounded uncertainty. Computers and Chemical Engineering, 28:1069-1085, 2004.
74. M.L. Liu and N.V. Sahinidis. Long range planning in the process industries: A projection approach. Computers and Operations Research, 23(3): 237-253, 1996.
75. A. Marin and B. Pelegrin. The return plant location problem: Modeling and resolution. European Journal of Operational Research, 104:375, 1998.
76. C.M. McDonald and I.A. Karimi. Planning and scheduling of parallel semicontinuous processes. 1. production planning. Industrial and Engineering Chemistry Research, 36:2691-2700, 1997.
77. C.A. Mendez and J. Cerda. Dynamic scheduling in multiproduct batch plants. Computers and Chemical Engineering, 27:1247-1259, 2003.
78. C.A. Mendez and J. Cerda. An MILP framework for batch reactive scheduling with limited discrete resources. Computers and Chemical Engineering, 28:1059-1068, 2004.
79. C.A. Mendez, J. Cerda, I.E. Grossmann, I. Harjunkoski, and M. Fahl. State-of-the-art review of optimization methods for short-term scheduling of batch processes. Computers and Chemical Engineering, 30(6-7):913- 946, 2006.
80. J. Mulvey, R. Vanderbei, and S. Zenios. Robust optimization of large scale systems. Operations Research, 43:264-281, 1995.
81. J.A. Nelder and R. Mead. A simplex method for function minimization. Computer Journal, 308-313, 1965.
82. S. Orcun, I.K. Altinel, and O. Hortacsu. General continuous-time models for production planning and scheduling of batch processing plants: Mixed integer linear program formulations and computational issues. Computers and Chemical Engineering, 25:371-389, 2001.
83. S. Orcun, K. Altinel, and O. Hortacsu. Scheduling of batch processes with operational uncertainties. Computers and Chemical Engineering, 20:S1191- S1196, 1996.
84. S.O. Orero and M.R. Irving. A combination of the genetic algorithm and lagrangian relaxation decomposition techniques for the generation unit commitment problem. Electric Power Systemic Research, 43:149-156, 1997.
85. C.C. Pantelides. Unified frameworks for the optimal process planning and scheduling. Proceedings on the Second Conference on Foundations of Computer Aided Operations, pages 253-274, 1994.
86. L.G. Papageorgiou and C.C. Pantelides. A hierarchical approach for campaign planning of multipurpose batch plants. Computers and Chemical Engineering, 17:S27-S32, 2000.
87. B. Penz, C. Rapine, and D. Trystram. Sensitivity analysis of scheduling algorithms. European Journal of Operational Research, 134(3):606-615, 2001.
88. S.B. Petkov and C.D. Maranas. Multiperiod planning and scheduling of multiproduct batch plants under demand uncertainty. Industrial and Engineering Chemistry Research, 36(11):4864-4881, 1997.
89. D. Petrovic and A. Duenas. A fuzzy logic based production scheduling/ rescheduling in the presence of uncertain disruptions. Fuzzy Sets and Systems, 2006.
90. K. Rana and R.G. Vickson. Routing container ships using lagrangean relaxation and decomposition. Transactions of Science, 25(3), 1991.
91. M.T.M. Rodrigues, L. Gimeno, C.A.S. Passos, and M.D. Campos. Reactive scheduling approach for multipurpose chemical batch plants. Computers and Chemical Engineering, 20:S1215-S1220, 1996.
92. J. Roslof, I. Harjunkoski, J. Bjorkqvist, S. Karlsson, and T. Westerlund. An milp-based reordering algorithm for complex industrial scheduling and rescheduling. Computers and Chemical Engineering, 25:821-828, 2001.
93. D. Ruiz, J. Canton, J.M. Nougues, A. Espuna, and L. Puigjaner. On-line fault diagnosis system support for reactive scheduling in multipurpose batch chemical plants. Computers and Chemical Engineering, 25:829-837, 2001.
94. J.H. Ryu, V. Dua, and E.N. Pistikopoulos. A bilevel programming framework for enterprise-wide process networks under uncertainty. Computers and Chemical Engineering, 28(6-7):1121-1129, 2004.
95. I. Sabuncuoglu and M. Bayiz. Analysis of reactive scheduling problems in a job shop environment. Research Report, pages IEOR-9826, 1998.
96. N.V. Sahinidis, I.E. Grossmann, R.E. Fornari, and M. Chathrathi. Optimization model for long range planning in the chemical industry. Computers and Chemical Engineering, 13(9):1049-1063, 1989.
97. O. Samikoglu, S.J. Honkomp, J.F. Pekny, and G.V. Reklaitis. Sensitivity analysis for project planning and scheduling under uncertain completions. Computers and Chemical Engineering, 22:S871-S874, 1998.Suppl. S.
98. G. Sand, S. Engell, A. Markert, R. Schultz, and C. Schultz. Approximation of an ideal online scheduler for a multiproduct batch plant. Computers and Chemical Engineering, 24:361-367, 2000.
99. E. Sanmarti, A. Espuna, and L. Puigjaner. Batch production and preventive maintenance scheduling under equipment failure uncertainty. Computers and Chemical Engineering, 21(10):1157-1168, 1997.
100. E. Sanmarti, A. Huercio, A. Espuna, and L. Puigjaner. A combined scheduling/ reactive scheduling strategy to minimize the effect of process operations uncertainty in batch plants. Computers and Chemical Engineering, 20:1263- 1268, 1996.
101. V. Saraswat and P.V. Hentenryck. Principles and practice of constraint programming.pages 245-268. The MIT Press, 1995.
102. G. Schilling and C.C. Pantelides. Optimal periodic scheduling of multipurpose plants. Computers and Chemical Engineering, 23(4-5):635-655, 1999.
103. M. Seron, J.A. De Dona, and G.C. Goodwin. Global analytical model predictive control with input constraints. In Proceedings of IEEE Conference Decision and Control, Sydney, 2000.
104. N. Shah and C.C. Pantelides. A general algorithm for short term scheduling of batch operations - II. Computational issues. Computers and Chemical Engineering, 17:229, 1993.
105. N. Shah, C.C. Pantelides, and R.W.H. Sargent. Optimal periodic scheduling of multipurpose batch plants. Annals of Operations Research, 42: 193-228, 1993.
106. A.L. Soyster. Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research, 21:1154- 1157, 1973.
107. D. Subramanian, J.F. Pekny, and G.V. Reklaitis. A simulation-optimization framework for addressing combinatorial and stochastic aspects of an r&d pipeline management problem. Computers and Chemical Engineering, 24: 1005-1011, 2000.
108. V. Suresh and D. Chaudhuri. Dynamic scheduling-a survey of research. International Journal of Production Economics, 32(1):53-63, 1993.
109. J.M. Thizy and L.N.V. Wassenhove. Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation. IIE Trans, 17: 308, 1985.
110. G.L. Thompson and D.J. Zawack. A problem expanding parametric programming method for solving the job shop scheduling problem. Annals of Operations Research, 4(1):327 - 342, 1985.
111. P. Tondel, T.A. Johansen, and A. Bemporad. An algorithm for multiparametric quadratic programming and explicit MPC solutions. In IEEE Conference on Decision and Control, pages 1199-1204, 2001.
112. M. Turkay and I.E. Grossmann. Logic-based MINLP algorithms for the optimization of process systems with discontinuous investment costs-multiple size regions. Industrial and Engineering Chemistry Research, 35:2611-2623, 1996.
113. S.A.V.E. Heever and I.E. Grossmann. A strategy for the integration of production planning and reactive scheduling in the optimization of a hydrogen supply network. Computers and Chemical Engineering, 27(12):1813-1839, 2003.
114. J.P. Vin and M.G. Ierapetritou. A new approach for efficient rescheduling of multiproduct batch plants. Industrial and Engineering Chemistry Research, 39:4228-4238, 2000.
115. J.P. Vin and M.G. Ierapetritou. Robust short-term scheduling of multiproduct batch plants under demand uncertainty. Industrial and Engineering Chemistry Research, 40:4543-4554, 2001.
116. J. Wang. A fuzzy robust scheduling approach for product development projects. European Journal of Operational Research, 152(1):180-194, 2004.
117. D. Wu and M.G. Ierapetritou. Hierarchical approach for production planning andscheduling under uncertainty using continuous-time formulation. In Foundations of Computer-Aided Process Design 2004 Conference Proceedings, Princeton University, 2004.
118. C. Yu and H. Li. A robust optimization model for stochastic logistic problems. International Journal of Production Economics, 64:385-397, 2000.
119. X.X. Zhu and T. Majozi. Novel continuous-time milp formulation for multipurpose batch plants. 2. integrated planning and scheduling. Industrial and Engineering Chemistry Research, 40:5621-5634, 2001.
120. J. Zowe. Nondifferentiable Optimization. Comput. Math. Progrm. in Computer and Systems Science, NATO ASI Series. Springer-Verlag, 1985.