Coordinated scheduling on parallel, machines with batch delivery

被引:18
作者
Wan, Long [1 ]
Zhang, An [2 ]
机构
[1] Jiangxi Univ Finance & Econ, Sch Informat Technol, Nanchang, Jiangxi, Peoples R China
[2] Hangzhou Dianzi Univ, Inst Operat Res & Cybernet, Hangzhou 310018, Zhejiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Scheduling; Batching and delivery; Complexity; Worst-case analysis; COMMON DUE-DATE; SINGLE-MACHINE; EARLINESS-TARDINESS; COSTS;
D O I
10.1016/j.ijpe.2014.01.009
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper considers coordinated scheduling on parallel identical machines with batch delivery. Jobs are first processed on m parallel and identical machines in the manufacturing facility and then delivered to the customer in batches. There are v identical transporters that can carry up to c jobs in one shipment. The objective is to minimize the sum of job arrival times. We show that the problem is NP-hard in the strong sense if m is part of the input. Besides, we propose the first approximation algorithm for the problem and prove that the worst case ratio of the algorithm is 2-1/m for any m. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:199 / 203
页数:5
相关论文
共 14 条