Algorithms for F2→D丨v=1,c≥1丨Cmax
In this paper, we study a flow shop problem called F2→D丨v=1, c ≥1”Cmax In the problem, there are n jobs needed to be processed on machine A first, then on machine B, after machine B finishes the job, the job will be carried to the destination by the transporter V.The transporter V is initially located on machine B.The transporter V can carry at most c jobs to destination every time where c ≥ 1.It costs some time transporting jobs to destination and going back to machine B for transporter V.The objective is to minimize the completion time when all the jobs are carried to the destination.In this paper, we study the special case F2 → D丨v=1, B(i)=p, c ≥ 1丨Cmax where each job has identical processing time on machine B, and give an optimal algorithm.
Flow shop Makespan Transporting time
Yinling Wang Xin Han Haoyi Wang
Software School,Dalian University of Technology,Dalian 116620,China
国内会议
金华
中文
1-10
2015-10-30（万方平台首次上网日期，不代表论文的发表时间）