【摘要】 研究目标函数为使最大完工时间达到最小的三台机器情况下的流水作业排序问题,同一工件在某台机器上完工后和在下一台机器上开始加工这段时间内,存在称为运输时间的时间间隔,所有的运输工作均由自动机来完成,自动机在同一时间内最多运输一个工件,文章研究该问题及其特殊情况下的复杂性.更多还原

【Abstract】 The paper considers the problem of scheduling jobs in a three-machine flow-shop to minimize the makespan.Between the completion of an operation and the beginning of the next operation of the same job,there is a time lag,which we refer to it as the transportation time.All transportation times have to be done by a single robot,which can perform at most one transportation at a time.New complexity results are derived for special case.更多还原