摘要
对带有维护活动和工件退化的单机排序问题进行研究。机器需要在某一个时间段内进行维护以提高其加工速度,且在这段时间内机器不能加工任何工件。机器维护后恢复到初始状态,工件的退化效应重新开始,其中机器的维护时间是维护开始时间的线性非减函数,工件的实际加工时间是与其特定位置有关的退化函数。目标是找到机器的最优维护位置、极小化时间表长。对于单机情形,给出了最优排序的一些性质。在特定条件下,证明了最优排序与工件排序无关,最优维护活动排在给定排序的中间位置。
We study scheduling problem on a single machine with deteriorating jobs under deteriorating maintenance consideration.In a certain period of time,the machine needs to be maintained to improve the processing speed,and during the period the machine can not process any jobs.Once completing the maintenance,the machine restores the processing efficiency,and the deterioration of jobs will start again.The machine maintenance duration is given as a linear nondecreasing function of its starting time.The actual processing time of a job is relevant to its position-specific degradation function.The objective is to find the optimal maintenance position and minimize the makespan.We give some properties of the optimal sequencing for the case with a single machine and prove that under certain conditions,the optimal sequencing is independent with the job scheduling,and the optimal policy is to schedule the maintenance activity in the middle of the task sequence.
出处
《沈阳师范大学学报（自然科学版）》
CAS
2015年第4期477-481,共5页
Journal of Shenyang Normal University:Natural Science Edition
基金
辽宁省教育厅高等学校科学研究项目(2008z192)
关键词
单机排序
退化维护
时间表长
退化工件
single machine
deteriorating maintenance
makespan
deteriorating jobs
