带运输时间和自动机的流水作业排序问题的复杂性  

Flow-shop Scheduling Problem with Transportation Times and a Single Robot

作　　者：时凌[1] 文军[1] 

机构地区：[1]湖北民族学院数学系,恩施445000

出　　处：《数学物理学报（A辑）》2008年第5期967-970,共4页Acta Mathematica Scientia

基　　金：湖北省教育厅科学研究项目(B20082907)资助

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

关 键 词：流水作业排序问题 运输时间 自动机 复杂性 

分 类 号：O223[理学—运筹学与控制论]