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.
|Titolo:||A Hybrid Approach to the Single Line Scheduling Problem with Multiple Products and Sequence-dependent Time|
|Data di pubblicazione:||2003|
|Digital Object Identifier (DOI):||10.1016/S0360-8352(03)00075-5|
|Appare nelle tipologie:||1.1 Articolo in rivista|