Polyhedral results for discrete-time production planning MIP formulations for continuous processes

Computers and Chemical Engineering - Tập 33 - Trang 1890-1904 - 2009
Christos T. Maravelias1, Konstantinos Papalamprou2
1Department of Chemical and Biological Engineering, University of Wisconsin-Madison, 1415 Engineering Dr., Madison, WI, 53706, USA
2Operational Research Group, Department of Management, London School of Economics and Political Science, Houghton Street, London WC2A 2AE, UK

Tài liệu tham khảo

Ahuja, 1993 Appa, 2004, Rational and integral k-regular matrices, Discrete Mathematics, 275, 1, 10.1016/S0012-365X(03)00095-5 Appa, 2007, Optimization with binet matrices, Operations Research Letters, 35, 345, 10.1016/j.orl.2006.04.003 Cook, 1997 Bixby, 1988, Finding embedded network rows in linear programs. I. Extraction heuristics, Management Science, 34, 342, 10.1287/mnsc.34.3.342 Edmonds, 1965, Maximum matching and a polyhedron with 0–1 vertices, Journal of Research of the National Bureau of Standards, 69B, 125, 10.6028/jres.069B.013 Ford, 1962 Fulkerson, 1965, Incidence matrices and interval graphs, Pacific Journal of Mathematics, 15, 833, 10.2140/pjm.1965.15.835 Glover, 1974, Implementation and computational comparisons of primal, dual and primal–dual computer codes for minimum cost network flow problem, Networks, 4, 191, 10.1002/net.3230040302 Gulpinar, 2004, Extracting pure network submatrices in linear programs using signed graphs, Discrete Applied Mathematics, 137, 359, 10.1016/S0166-218X(03)00361-5 Hoffman, 1956, Integral boundary points of convex polyhedra, 223 Kondili, 1993, General algorithm for short-term scheduling of batch operations—I. MILP formulation, Computers & Chemical Engineering, 17, 211, 10.1016/0098-1354(93)80015-F Kotnyek, B. (2002). A generalization of totally unimodular and network matrices. Ph.D. thesis. London School of Economics and Political Science, London, UK. Land, 1960, An automatic method for solving discrete programming models, Economics, 28, 83 Maravelias, 2005, Mixed time representation for state-task network models, Industrial & Engineering Chemistry Research, 44, 9129, 10.1021/ie0500117 Maravelias, C. T., & Sung, C. (2009). Integration of production planning and scheduling: Overview, challenges and opportunities. Computers and Chemical Engineering, doi:10.1016/j.compchemeng.2009.06.007, available on-line. Mendez, 2006, State-of-the-art review of optimization methods for short-term scheduling of batch processes, Computers & Chemical Engineering, 30, 913, 10.1016/j.compchemeng.2006.02.008 Nemhauser, 1988 Pochet, 2006 Shah, 2005, Process industry supply chains: Advances and challenges, Computers & Chemical Engineering, 29, 1225, 10.1016/j.compchemeng.2005.02.023 Sung, 2007, An attainable region approach for effective production planning of multi-product processes, American Institute of Chemical Engineering Journal, 53, 1298, 10.1002/aic.11167 Wolsey, 1998