[article] 
inIndustrial & engineering chemistry research > Vol. 51 N° 25 (Juin 2012) . - pp. 8535-8549

Titre :	Rule - based scheduling of single - stage multiproduct batch plants with parallel units
Type de document :	texte imprimé
Auteurs :	Bin Shi, Auteur ; Lie-Xiang Yan, Auteur ; Wei, Wu, Auteur
Année de publication :	2012
Article en page(s) :	pp. 8535-8549
Note générale :	Industrial chemistry
Langues :	Anglais (eng)
Mots-clés :	Batchwise Scheduling
Résumé :	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.
ISSN :	0888-5885
En ligne :	http://cat.inist.fr/?aModele=afficheN&cpsidt=26066780

[article] Rule - based scheduling of single - stage multiproduct batch plants with parallel units [texte imprimé] / Bin Shi, Auteur ; Lie-Xiang Yan, Auteur ; Wei, Wu, Auteur . - 2012 . - pp. 8535-8549.
Industrial chemistry
Langues : Anglais (eng)
in Industrial & engineering chemistry research > Vol. 51 N° 25 (Juin 2012) . - pp. 8535-8549

Mots-clés :	Batchwise Scheduling
Résumé :	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.
ISSN :	0888-5885
En ligne :	http://cat.inist.fr/?aModele=afficheN&cpsidt=26066780