The present paper presents ahybridapproach for solving manufacturing schedulingproblems, based on the integration between Constraint Logic Programming (CLP) and Genetic Algorithm (GA) approaches. The proposed methodology is applied to asingleline with multipleproducts and sequence-dependenttime. This system model derives from a real case of a company producing sheets for catalytic converters. A sensitivity analysis of the hybrid methodology is carried out to compare the performance of the CLP, GA and integrated CLP–GA approaches.
A Hybrid Approach to the Single Line Scheduling Problem with Multiple Products and Sequence-dependent Time / Spina, Roberto; Galantucci, Luigi Maria; Dassisti, Michele. - In: COMPUTERS & INDUSTRIAL ENGINEERING. - ISSN 0360-8352. - 45:4(2003), pp. 573-583. [10.1016/S0360-8352(03)00075-5]
A Hybrid Approach to the Single Line Scheduling Problem with Multiple Products and Sequence-dependent Time
SPINA, Roberto;GALANTUCCI, Luigi Maria;DASSISTI, Michele
2003-01-01
Abstract
The present paper presents ahybridapproach for solving manufacturing schedulingproblems, based on the integration between Constraint Logic Programming (CLP) and Genetic Algorithm (GA) approaches. The proposed methodology is applied to asingleline with multipleproducts and sequence-dependenttime. This system model derives from a real case of a company producing sheets for catalytic converters. A sensitivity analysis of the hybrid methodology is carried out to compare the performance of the CLP, GA and integrated CLP–GA approaches.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
