作业车间调度
调度(生产过程)
单机调度
地铁列车时刻表
机械加工
计算机科学
数学优化
时间复杂性
生产(经济)
工程类
数学
算法
机械工程
操作系统
宏观经济学
经济
标识
DOI:10.1080/00207543.2019.1566675
摘要
In this paper, the single-machine scheduling problems with deteriorating effects and a machine maintenance are studied. In this circumstance, the deterioration rates of the jobs during the machining process are the same which reduces the production efficiency. The actual processing time of the job is a linearly increasing function of the starting time. In this process, the machine only performs a maintenance activity, and the maintenance time is a fixed value. After the maintenance work is completed, the machine will be restored to the initial state, and the deterioration of the job will be start again. The goal is to determine the optimal schedule in order to minimise the maximum completion time (i.e. the makespan) and the sum of job completion times. We prove that both problems are polynomial time solvable, and we also provide the corresponding algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI