共 50 条
Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
被引:8
|作者:
Lu, Lingfa
[1
]
Zhang, Liqi
[2
]
Wan, Long
[3
]
机构:
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
[2] Henan Agr Univ, Coll Informat & Management Sci, Zhengzhou 450003, Henan, Peoples R China
[3] Jiangxi Univ Finance & Econ, Sch Informat Technol, Nanchang 330013, Jiangxi, Peoples R China
关键词:
Scheduling;
Production and delivery;
Serial batch;
Approximation algorithm;
SINGLE-MACHINE;
JOB DELIVERY;
TIMES;
D O I:
10.1016/j.tcs.2015.01.014
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
In this paper, we study the integrated production and delivery scheduling on a serial batch machine. The objective is to minimize the makespan, i.e., the maximum delivery completion time of the jobs. We consider four distinct problems which depend on whether split is allowed in the production or delivery of the jobs. We present a polynomial-time algorithm for the first problem and show that other three problems are strongly NP-hard. Furthermore, we provide effective approximation algorithms for the three NP-hard problems. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:50 / 57
页数:8
相关论文