Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur Luis J. Zeballos
Documents disponibles écrits par cet auteur
Affiner la rechercheHybrid 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)
[article]
in Industrial & 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