具有优势机器和恶化工件的流水作业排序问题

针对流水作业排序问题,建立了具有优势机器和恶化工件并且有无空闲限制的排序模型.在该排序模型中,机器加工工件时,工件的相邻加工工序之间不允许出现空闲,工件的加工时间是其开工时间的严格增加线性函数.其中讨论的优势机器有2种情况:机器形成增减增优势关系和机器形成减增减优势关系.考虑了多台机器的流水作业排序问题,其中,目标函数分别为极小化最大完工时间和极小化总完工时间,对于这两类问题分别给出了求解最优排序的多项式算法和它们的计算复杂性,并通过证明证实了算法的有效性.

Flow Shop Scheduling Problems with Dominant Machines and Deteriorating Jobs

Aiming at flow shop scheduling problem,the model of the no-idle scheduling problems with dominant machines and deteriorating jobs is established.In this model,each machine must process the jobs without any idle time,and the processing time of a job is a strictly increasing linear function of its starting time.There are two cases of the dominant machines constraint: ididm and diddm.Consider two objectives: minimize the makespan and minimize the total completion time,and present a polynomial time solution alg...