.png){kind=icon}
返回
Precast production scheduling using multi-objective genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.01.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2011 Published by Elsevier Ltd.
Keyword:
Precast production
Scheduling
Multi-objective genetic algorithms
Buffer
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
分享收藏分享收藏EU Cohesion Policy post-2020, European Green Deal and Territorial Agenda 2030. The future of the place-based approach in the new EU policy framework in the context of COVID-19.png)
Europa XXI
OAAI
Europa XXIIF0
OAAI分享收藏A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines一种求解并行机多目标调度问题的多种群遗传算法
PREAI
分享收藏
查看更多内容