An integrated CP-based approach for scheduling of processing and transport units in pipeless plants / Luis J. Zeballos in Industrial & engineering chemistry research, Vol. 49 N° 4 (Fevrier 2010)  

Public ISBD [article]  inIndustrial & engineering chemistry research > Vol. 49 N° 4 (Fevrier 2010) . - pp 1799–1811 Titre : An integrated CP-based approach for scheduling of processing and transport units in pipeless plants Type de document : texte imprimé Auteurs : Luis J. Zeballos, Auteur ; Carlos A. Méndez, Auteur Année de publication : 2010 Article en page(s) : pp 1799–1811 Note générale : Chimie industrielle Langues : Anglais (eng) Mots-clés : Pipeless plants Integrated CP based. Résumé : This work addresses the simultaneous production and material handling scheduling problem typically arising in pipeless plants with alternative layouts. An integrated constraint programming (CP) methodology, comprising both a detailed CP model and a suitable search strategy, is developed to address manufacturing environments in which multiple products with different recipes are to be produced. The general pipeless plant topology involves fixed processing stations and a limited number of moveable vessels used to transfer the material between consecutive stations, according to the predefined product recipes. Because of the high combinatorial complexity of the problem, an efficient search methodology is also presented to significantly accelerate the search and reduce the computational effort. The applicability of the proposed integrated CP methodology (model + search strategy) is successfully tested with several challenging examples taken from literature. DEWEY : 660 ISSN : 0888-5885 En ligne : http://pubs.acs.org/doi/abs/10.1021/ie901176n [article] An integrated CP-based approach for scheduling of processing and transport units in pipeless plants [texte imprimé] / Luis J. Zeballos, Auteur ; Carlos A. Méndez, Auteur . - 2010 . - pp 1799–1811. Chimie industrielle Langues : Anglais (eng) in Industrial & engineering chemistry research > Vol. 49 N° 4 (Fevrier 2010) . - pp 1799–1811 Mots-clés : Pipeless plants Integrated CP based. Résumé : This work addresses the simultaneous production and material handling scheduling problem typically arising in pipeless plants with alternative layouts. An integrated constraint programming (CP) methodology, comprising both a detailed CP model and a suitable search strategy, is developed to address manufacturing environments in which multiple products with different recipes are to be produced. The general pipeless plant topology involves fixed processing stations and a limited number of moveable vessels used to transfer the material between consecutive stations, according to the predefined product recipes. Because of the high combinatorial complexity of the problem, an efficient search methodology is also presented to significantly accelerate the search and reduce the computational effort. The applicability of the proposed integrated CP methodology (model + search strategy) is successfully tested with several challenging examples taken from literature. DEWEY : 660 ISSN : 0888-5885 En ligne : http://pubs.acs.org/doi/abs/10.1021/ie901176n

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire

Hybrid mathematical programming discrete-event simulation approach for large-scale scheduling problems / Pedro M. Castro in Industrial & engineering chemistry research, Vol. 50 N° 18 (Septembre 2011)  

Public ISBD [article]  inIndustrial & engineering chemistry research > Vol. 50 N° 18 (Septembre 2011) . - pp. 10665-10680 Titre : Hybrid mathematical programming discrete-event simulation approach for large-scale scheduling problems Type de document : texte imprimé Auteurs : Pedro M. Castro, Auteur ; Adrian M. Aguirre, Auteur ; Luis J. Zeballos, Auteur Année de publication : 2011 Article en page(s) : pp. 10665-10680 Note générale : Chimie industrielle Langues : Anglais (eng) Mots-clés : Scheduling Mathematical programming Résumé : This article presents a new algorithm for industrially sized problems that, because of the large number of tasks to schedule, are either intractable or result in poor solutions when solved with full-space mathematical programming approaches. Focus is set on a special type of multistage batch plant featuring a single unit per stage, zero-wait storage policies, and a single transportation device for moving lots between stages. The algorithm incorporates a mixed-integer linear programming (MILP) continuous-time formulation and a discrete-event simulation model to generate a detailed schedule. More precisely, three stages are involved: (i) finding the best processing sequence, assuming that the transportation device is always available; (ii) generating a feasible schedule, taking into account the shared transportation resource; (iii) improving the schedule through a neighborhood search procedure. Relaxed and constrained versions of the full-space MILP are involved in stages (i) and (iii) with the simulation model taking care of stage (ii). Several examples are solved to illustrate the capabilities of the proposed method with the results showing better performance when compared to other published approaches. The balance between solution quality and total computational effort can easily be shifted by changing the number of lots rescheduled per iteration. DEWEY : 660 ISSN : 0888-5885 En ligne : http://cat.inist.fr/?aModele=afficheN&cpsidt=24523885 [article] Hybrid mathematical programming discrete-event simulation approach for large-scale scheduling problems [texte imprimé] / Pedro M. Castro, Auteur ; Adrian M. Aguirre, Auteur ; Luis J. Zeballos, Auteur . - 2011 . - pp. 10665-10680. Chimie industrielle Langues : Anglais (eng) in Industrial & engineering chemistry research > Vol. 50 N° 18 (Septembre 2011) . - pp. 10665-10680 Mots-clés : Scheduling Mathematical programming Résumé : This article presents a new algorithm for industrially sized problems that, because of the large number of tasks to schedule, are either intractable or result in poor solutions when solved with full-space mathematical programming approaches. Focus is set on a special type of multistage batch plant featuring a single unit per stage, zero-wait storage policies, and a single transportation device for moving lots between stages. The algorithm incorporates a mixed-integer linear programming (MILP) continuous-time formulation and a discrete-event simulation model to generate a detailed schedule. More precisely, three stages are involved: (i) finding the best processing sequence, assuming that the transportation device is always available; (ii) generating a feasible schedule, taking into account the shared transportation resource; (iii) improving the schedule through a neighborhood search procedure. Relaxed and constrained versions of the full-space MILP are involved in stages (i) and (iii) with the simulation model taking care of stage (ii). Several examples are solved to illustrate the capabilities of the proposed method with the results showing better performance when compared to other published approaches. The balance between solution quality and total computational effort can easily be shifted by changing the number of lots rescheduled per iteration. DEWEY : 660 ISSN : 0888-5885 En ligne : http://cat.inist.fr/?aModele=afficheN&cpsidt=24523885

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire