首页>
外文OA文献
>The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
【2h】
The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
展开▼
机译:三机流水车间调度问题,通过单独的设置时间来最大程度地减少最大延迟
展开▼
免费
页面导航
摘要
著录项
引文网络
相似文献
相关主题
摘要
We address the three-machine flowshop scheduling problem to minimise maximum lateness, where setup times are considered separate from processing times. We establish a dominance relation for the problem where it specifies which of the two adjacent jobs should precede in an optimal solution. Moreover, we propose three heuristics: Earliest Due Date (EDD), an Enhanced Earliest Due Date (EEDD) and a Polynomial Genetic-based Algorithm (PGA). We conduct computational analysis on randomly generated problems to evaluate the performance of the proposed heuristics. The analysis shows that the performance of EEDD is acceptable if the computational time is of the main concern and the number of jobs are large. The analysis also shows that PGA significantly outperforms EDD and EEDD.
展开▼