Single-machine scheduling with a variable maintenance activity

被引：51
|
作者：
Luo, Wenchang [1 ]
Cheng, T. C. E. [2 ]
Ji, Min [3 ]
机构：
[1] Ningbo Univ, Fac Sci, Ningbo 315211, Zhejiang, Peoples R China
[2] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
[3] Zhejiang Gongshang Univ, Sch Comp Sci & Informat Engn, Contemporary Business & Trade Res Ctr, Hangzhou 310018, Zhejiang, Peoples R China
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2015年 / 79卷
关键词：
Scheduling; Maintenance; Single machine; Polynomial-time algorithm; NON-AVAILABILITY INTERVAL; APPROXIMATION ALGORITHMS; COMPLETION TIMES; LATE JOBS; CONSTRAINTS; MINIMIZE; MAKESPAN; NUMBER;
D O I：
10.1016/j.cie.2014.11.002
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We consider the problem maintenance activity must starting time. We provide sum of completion times, of scheduling a maintenance activity and jobs on a single machine, where the start before a given deadline and the maintenance duration increases with its polynomial-time algorithms to solve the problems to minimize the makespan, maximum lateness, and number of tardy jobs. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码：168 / 174
页数：7
相关论文
共 50 条
12345