Decomposition techniques for the solution of large-scale scheduling problems

With increased product specialization within the chemical‐processing industries, the ability to obtain production schedules for complex facilities is at a premium. This article discusses ways of quickly obtaining solutions for industrially relevant, large‐scale scheduling problems. A number of time‐...

Full description

Saved in:
Bibliographic Details
Published in:AIChE journal 1996-12, Vol.42 (12), p.3373-3387
Main Authors: Bassett, Matthew H., Pekny, Joseph F., Reklaitis, Gintaras V.
Format: Article
Language:English
Subjects:
Applications of mathematics to chemical engineering. Modeling. Simulation. Optimization
Applied sciences
Chemical engineering
Exact sciences and technology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With increased product specialization within the chemical‐processing industries, the ability to obtain production schedules for complex facilities is at a premium. This article discusses ways of quickly obtaining solutions for industrially relevant, large‐scale scheduling problems. A number of time‐based decomposition approaches are presented along with their associated strengths and weaknesses. It is shown that the most promising of the approaches utilizes a reverse rolling window in conjunction with a disaggregation heuristic. In this method, only a small subsection of the horizon is dealt with at a time, thus reducing the combinatorial complexity of the problem. Resource‐ and task‐unit‐based decompositions are also discussed as possible approaches to reduce the problem to manageable proportions. A number of examples are presented throughout to clarify the discussion.
ISSN:0001-1541
1547-5905
DOI:10.1002/aic.690421209