Hierarchical decomposition heuristic for scheduling: Coordinated reasoning for decentralized and distributed decision-making problems

Abstract This paper presents a new technique for decomposing and rationalizing large decision-making problems into a common and consistent framework. We call this the hierarchical decomposition heuristic (HDH) which focuses on obtaining “globally feasible” solutions to the overall problem, i.e., solutions which are feasible for all decision-making elements in a system. The HDH is primarily intended to be applied as a standalone tool for managing a decentralized and distributed system when only globally consistent solutions are necessary or as a lower bound to a maximization problem within a global optimization strategy such as Lagrangean decomposition. An industrial scale scheduling example is presented that demonstrates the abilities of the HDH as an iterative and integrated methodology in addition to three small motivating examples. Also illustrated is the HDH's ability to support several types of coordinated and collaborative interactions.

[1]  Lyle H. Ungar,et al.  Pricing interprocess streams using slack auctions , 2000 .

[2]  Ignacio E. Grossmann,et al.  A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures , 2008, J. Glob. Optim..

[3]  Thomas E. Marlin,et al.  Model adequacy requirements for optimizing plant operations , 1994 .

[4]  J. D. Kelly.  Logistics : the missing link in blend scheduling optimization , 2006 .

[5]  Dan Wu,et al.  Decomposition approaches for the efficient solution of short-term scheduling problems , 2003, Comput. Chem. Eng..

[6]  Richard B. Maffei.  Brand Preferences and Simple Markov Processes , 1960 .

[7]  Christian Prins,et al.  Applications of optimisation with Xpress-MP , 2002 .

[8]  Joseph Z. Lu.  Challenging control problems and emerging technologies in enterprise optimization , 2001 .

[9]  Rainer Leisten,et al.  Decomposition and iterative aggregation in hierarchical and decentralised planning structures , 1995 .

[10]  Nan Zhang,et al.  Novel modelling and decomposition strategy for total site optimisation , 2006, Comput. Chem. Eng..

[11]  John L. Mann,et al.  Flowsheet decomposition heuristic for scheduling: a relax-and-fix method , 2004, Comput. Chem. Eng..

[12]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[13]  John F. Forbes,et al.  Price-driven coordination method for solving plant-wide MPC problems , 2007 .

[14]  I. Grossmann,et al.  A Decomposition Method for the Simultaneous Planning and Scheduling of Single-Stage Continuous Multiproduct Plants , 2006 .

[15]  Jeffrey D. Kelly.  Production Modeling for Multimodal Operations , 2004 .

[16]  Jeffrey D. Kelly.  Modeling production-chain information , 2005 .

[17]  Matthew H. Bassett,et al.  Decomposition techniques for the solution of large-scale scheduling problems , 1996 .

[18]  Jeffrey D. Kelly.  Chronological decomposition heuristic for scheduling: Divide and conquer method , 2002 .

[19]  W. Art Chaovalitwongse,et al.  Optimization and logistics challenges in the enterprise , 2009 .

[20]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[21]  Jeffrey D. Kelly,et al.  Multi-Product Inventory Logistics Modeling in the Process Industries , 2009 .

[22]  Thomas E. Marlin,et al.  Model accuracy for economic optimizing controllers : the bias update case , 1994 .