LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

An Effective Milp-based Decomposition Algorithm for the Integrated Design and Scheduling of Flexible Job-shop Plants

Photo from wikipedia

This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multi-stage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the… Click to show full abstract

This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multi-stage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the scheduling problem considering the existing plant configuration with the main goal of minimizing the makespan. Then, a second objective of minimizing the number of units utilized without worsen the makespan achieved in the first stage is considered. The units released can be reallocated to other compatible processing stages in order to minimize the initial makespan value. In order to tackle large industrial examples, both scheduling and redesign problems are solved through a decomposition algorithm, which has a MILP model as its core. The procedure is tested on several realistic instances, demonstrating its robustness and applicability.

Keywords: decomposition algorithm; decomposition; milp based; effective milp; algorithm integrated

Journal Title: Chemical engineering transactions
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.