Machine Scheduling with a Maintenance Interval and Job Delivery Coordination

被引:0
|
作者
Hu, Jueliang [1 ]
Luo, Taibo [2 ,3 ]
Su, Xiaotong [1 ]
Dong, Jianming [1 ]
Tong, Weitian [3 ]
Goebel, Randy [3 ]
Xu, Yinfeng [2 ,4 ]
Lin, Guohui [1 ,3 ]
机构
[1] Zhejiang Sci Tech Univ, Dept Math, Hangzhou 310018, Zhejiang, Peoples R China
[2] Sichuan Univ, Sch Business, Chengdu 610065, Sichuan, Peoples R China
[3] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2E8, Canada
[4] State Key Lab Mfg Syst Engn, Xian 710049, Shaanxi, Peoples R China
来源
关键词
Scheduling; Machine maintenance; Job delivery; Bin-packing; Approximation algorithm; Worst-case performance analysis;
D O I
10.1007/978-3-319-19647-3_10
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We investigate a scheduling problem with job delivery coordination in which the machine has a maintenance time interval. The goal is to minimize the makespan. In the problem, each job needs to be processed on the machine non-preemptively for a certain time, and then transported to a distribution center; transportation is by one vehicle with a limited physical capacity, and it takes constant time to deliver a shipment to the distribution center and return back to the machine. We present a 2-approximation algorithm for the problem, and show that the performance ratio is tight.
引用
收藏
页码:104 / 114
页数:11
相关论文
共 50 条