Scheduling a two-machine flowshop with travel times to minimize maximum lateness

被引:24
作者
Stevens, JW
Gemmill, DD
机构
[1] Iowa State University, Ames, IA, 50011
关键词
D O I
10.1080/002075497195948
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
As fully automated manufacturing becomes a realization, the problem of scheduling jobs to meet customer due dates come to the forefront. In this paper, possible sequencing methods are generated for an automated two-machine flowshop with non-negligible transportation times and blocking of the second machine. Two heuristics are developed to sequence a set of jobs with the objective of minimizing maximum lateness. The cases of scheduling the flowshop when it starts in a null state and a busy state are both investigated.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 15 条