Rule-based scheduling of single-stage multiproduct batch plants with parallel units

Bin Shi, Lie Xiang Yan, Wei Wu

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

A new rule-based model for single-stage multiproduct scheduling problem (SMSP) in batch plants with parallel units is proposed. The scheduling problem is decomposed into two subproblems of order assignment and order sequencing. A group of order assignment rules are introduced to select suitable units for customer orders. While flexible constraint handling strategies are proposed to eliminate the constraints of forbidden units and unit release times and convert the hard constraint of forbidden sequences to a soft one, leading to any arbitrary order sequence can be synthesized into a legal schedule. The line-up competition algorithm (LUCA) is presented to obtain optimal order sequence and order assignment rule, which can minimize makespan, total tardiness, or total cost. Through comparative study, the proposed approach has demonstrated its effectiveness for solving a large size SMSP.

Original languageEnglish
Pages (from-to)8535-8549
Number of pages15
JournalIndustrial and Engineering Chemistry Research
Volume51
Issue number25
DOIs
Publication statusPublished - 2012 Jun 27

All Science Journal Classification (ASJC) codes

  • Chemistry(all)
  • Chemical Engineering(all)
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Rule-based scheduling of single-stage multiproduct batch plants with parallel units'. Together they form a unique fingerprint.

Cite this