A decomposition framework for the scheduling of single- and multi-stage processes

Balas, 1975, Facets of the knapsack polytope, Mathematical Programming, 8, 146, 10.1007/BF01580440 Balas, 1998, Job shop scheduling with deadlines, Journal of Combinatorial Optimization, 1, 329, 10.1023/A:1009750409895 Balas, 1998, Guided local search with shifting bottleneck for job shop scheduling, Management Science, 44, 262, 10.1287/mnsc.44.2.262 Baptiste, 2001 Bockmayr, 1998, Branch and infer: A unifying framework for integer and finite domain constraint programming, INFORMS Journal on Computing, 10, 287, 10.1287/ijoc.10.3.287 Bockmayr, 2003, Detecting infeasibility and generating cuts for MIP using CP, 24 Floudas, 2004, Continuous-time versus discrete-time approaches for scheduling of chemical processes: A review, Comput. Chem. Eng., 28, 2109, 10.1016/j.compchemeng.2004.05.002 Harjunkoski, 2002, Decomposition techniques for multistage scheduling problems using mixed-integer and constrained programming methods, Computers and Chemical Engineering, 26, 1533, 10.1016/S0098-1354(02)00100-X Heipcke, 1999, An example of integrating constraint programming and mathematical programming, Electronic Notes in Discrete Mathematics, 1 Van Hentenryck, 1989 Van Hentenryck, 2002, Constraint and integer programming in OPL, INFORMS Journal on Computing, 14, 345, 10.1287/ijoc.14.4.345.2826 Hooker, 2000 Hooker, 2002, Logic, optimization, and constraint programming, INFORMS Journal on Computing, 14, 295, 10.1287/ijoc.14.4.295.2828 Hooker, 2000, A scheme for unifying optimization and constraint satisfaction methods, Knowledge Engineering Review, 15, 11, 10.1017/S0269888900001077 Jain, 2001, Algorithms for hybrid MILP/CP Model for a class of optimization problems, INFORMS Journal on Computing, 13, 258, 10.1287/ijoc.13.4.258.9733 Kelly, 2002, Chronological decomposition heuristic for scheduling: Divide and conquer method, AIChE Journal, 48, 2995, 10.1002/aic.690481226 Kelly, 2003, Smooth-and-dive accelerator: A Pre-MILP primal heuristic applied to scheduling, Computers and Chemical Engineering, 27, 827, 10.1016/S0098-1354(02)00267-3 Kelly, 2004, Flowsheet decomposition heuristic for scheduling: A relax-and-fix method, Computers and Chemical Engineering, 28, 2193, 10.1016/j.compchemeng.2004.03.009 Kondili, 1993, A general algorithm for short-term scheduling of batch operations—I. MILP formulation, Computers and Chemical Engineering, 17, 211, 10.1016/0098-1354(93)80015-F Maravelias, 2003, A new general continuous-time state task network formulation for the short-term scheduling of multipurpose batch plants, Industrial and Engineering Chemistry Research, 42, 3056, 10.1021/ie020923y Maravelias, 2004, A hybrid MILP/CP decomposition approach for the short term scheduling of multipurpose batch plants, Computers and Chemical Engineering, 28, 1921, 10.1016/j.compchemeng.2004.03.016 Marriott, 1999 Pekny, 1998, Towards the convergence of theory and practice: A technology guide for scheduling/planning methodology, 91 Pinto, 1998, Assignment and sequencing models for the scheduling of chemical processes, Annals of Operations Research, 81, 433, 10.1023/A:1018929829086 Reklaitis, 1992 Rippin, 1993, Batch process systems engineering: A retrospective and prospective review, Computers and Chemical Engineering, 17, S1, 10.1016/0098-1354(93)80201-W Rodosek, 1999, A new approach to integrating mixed integer programming and constraint logic programming, Annals of Operations Research, 86, 63, 10.1023/A:1018904229454 Shah, 1998, Single- and multi-site planning and scheduling: Current status and future challenges, AIChE Symposium Series, 94, 75 Thorsteinsson, 2001, Branch-and-check: A hybrid framework integrating mixed-integer programming and constraint logic programming, Lecture Notes in Computer Science, 16, 10.1007/3-540-45578-7_2 Wolsey, 1975, Faces for a linear inequality in 0–1 variables, Mathematical Programming, 8, 165, 10.1007/BF01580441