期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 40, 期 17, 页码 4353-4380出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540210159536
关键词
-
We treat the n-job, two-stage hybrid flowshop problem with one machine in the first stage and two different machines in parallel in the second stage. The objective is to minimize the makespan. We demonstrate that the problem is NP-complete. We formulate a dynamic program, which is beyond our grasp for problems of more than 15 jobs. Our search for heuristic approaches led to the adoption of the Johnson sequence, which motivated two of the three approaches: dynamic programming and sequence-and-merge. The third approach, the greedy heuristic, was included as example of an elementary heuristic.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据