具有加工时间可控的学习效应的排序问题

Scheduling Problems with Learning Effect and Controllable Processing Times

讨论一类具有学习效应的加工时间可控的排序问题,工件的加工时间不仅与所排的位置有关,还与控制变量有关,并且工件具有共同工期.目标函数是极小化加权总完工与控制费用的和、极小化总误工时间与控制费用的和.对最优排序的问题,将其转化为指派问题,并给出其算法和复杂度.

This paper studies the machine scheduling problems with learning effect and controllable pro cessing times, where the processing time of a job is related to the row of position and the controllable vari able. And we think that jobs have the common due date. Our objective functions： a cost including total weighted completion time and total controllable cost, a cost including total tardiness time and total con trollable cost. The problem of the optimal sequence is converted to assignment problem, and we present the algorithms and the complexity of the algorithms.