Precast production scheduling using multi-objective genetic algorithms

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.

► 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.