由两台柔性机器组成的流水作业问题

Scheduling Problems in a Flowshop Composed of Two Flexible Machines

研究了由两台柔性机器所组成的流水作业问题 ,其中有 n个相同工件 ,每一工件需先在机器 1上完成所需时间为 p1 的第一次加工 ,然后需单独在机器 1上或单独在机器 2上完成所需时间分别为 p1 2 、p2 1 的第二次加工 ,最后在机器 2上完成所需时间为 p2 的第三次加工 .要求适当安排这 n个工件的加工方式和次序以使加工全程 (Cmax)最小 .本文对此问题给出了分析解 .

This paper studies the scheduling problems in a flowshop composed of two flexible machines, in which there are n identical jobs, each of which needs to be processed first on machine 1 with a processing time p 1 , then either processed separately on machine 1 with a processing time p 12 or on machine 2 with a processing time p 21 , and finally processed on machine 2 with a processing time p 2 . Our purpose is to properly schedule the processing mode and the sequence in order to minimize the makespan.In this paper we give the analytic solution to this problem.