摘要
讨论带有维修活动区间且与时间有关的单机排序问题.工件的实际加工时间是关于这个工件开始加工时间的线性函数,其在加工工件的过程中需要进行维修,维修过程中及不能加工工件,且维修与时间有关.维修过后机器加工工件的速度也发生变化.目标是确定维修的位置及排序,从而使目标函数最小.
This paper considers single-machine scheduling a dereriorating maintenance activity with time.The actual processing time is a linear function of the starting time.The workpiece needs to be maintained in the process of maching,and can not be processed during maintenance. After maintenance,the processing speed of the machine is changed.The goal is to determine the location of the maintenance,so that the objective function is minimized.
作者
陈耀宁
柳秉昉
CHENG Yaoling;LIU Bingfang(School of Mathematics Science, Chongqing Normal University, Chongqing 401331, China;School of Educational Science, Chongqing Normal University, Chongqing 401331, China)
出处
《湖北民族学院学报(自然科学版)》
CAS
2017年第1期56-58,75,共4页
Journal of Hubei Minzu University(Natural Science Edition)
关键词
单机排序
维修活动
加工时间
single machine scheduling
maintenance
proccessing time