Precast production scheduling using multi-objective genetic algorithms

► This research develops a multi-objective precast production scheduling model (MOPPSM). ► In the model, production resources and buffer size between stations are considered. ► A multi-objective genetic algorithm is then developed to search for optimum solutions with minimum makespan and tardiness p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Expert systems with applications Jg. 38; H. 7; S. 8293 - 8302
Hauptverfasser: Ko, Chien-Ho, Wang, Shu-Fan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.07.2011
Schlagworte:
ISSN:0957-4174, 1873-6793
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:► This research develops a multi-objective precast production scheduling model (MOPPSM). ► In the model, production resources and buffer size between stations are considered. ► A multi-objective genetic algorithm is then developed to search for optimum solutions with minimum makespan and tardiness penalties. ► The performance of the proposed model is validated by using five case studies. ► The experimental results show that the MOPPSM can successfully search for optimum precast production schedules. ► Furthermore, considering buffer sizes between stations is crucial for acquiring reasonable and feasible precast production schedules. The goal of production scheduling is to achieve a profitable balance among on-time delivery, short customer lead time, and maximum utilization of resources. However, current practices in precast production scheduling are fairly basic, depending heavily on experience, thereby resulting in inefficient resource utilization and late delivery. Moreover, previous methods ignoring buffer size between stations typically induce unfeasible schedules. Certain computational techniques have been proven effective in scheduling. To enhance precast production scheduling, this research develops a multi-objective precast production scheduling model (MOPPSM). In the model, production resources and buffer size between stations are considered. A multi-objective genetic algorithm is then developed to search for optimum solutions with minimum makespan and tardiness penalties. The performance of the proposed model is validated by using five case studies. The experimental results show that the MOPPSM can successfully search for optimum precast production schedules. Furthermore, considering buffer sizes between stations is crucial for acquiring reasonable and feasible precast production schedules.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2011.01.013