同时带有安装时间和送出时间的单机排序问题

摘要

在实际生产，如钢铁和冶金工业生产过程中，工件在加工之前需要预热或安装必要的夹具和固定装置，在加工之后工件需要进行冷却处理等，也就是工件在进行加工时常常带有安装时间和送出时间。讨论带有学习效应、安装时间和送出时间的单机排序问题。在这一模型中，工件的实际加工时间是与工件的基本加工时间和工件的实际加工位置相关的一般函数。工件的安装时间和送出时间均依赖于已加工完的工件的实际加工时间，即 p-s-d 形式。目标函数分别为最大完工时间、总完工时间、加权总完工时间、总延误时间、最大延误时间和最大延迟时间，提出了上述问题的最优排序规则。%This paper studies the single machine scheduling problems with learning effect,setup time and delivery time. In this model,the actual processing time of a job is a general function of the normal processing time of the job and its scheduled position.The setup time and delivery time depend on a general function of the processing times of the jobs already processed and its scheduled position,i.e.,the setup time and delivery time are past-sequence-dependent(p-s-d). The obj ectives are to minimize the makespan,the total completion time,the total weighted completion time,the total tardiness,the maximum tardiness,and the maximum lateness.We provide the optimal schedules for some single-machine problems and results show that they are solvable in polynomial time respectively.