Maximizing the weighted number of just-in-time jobs in flow shop scheduling

被引：26
|
作者：
Choi, Byung-Cheon
Yoon, Suk-Hun
机构：
[1] Soongsil Univ, Dept Ind & Informat Syst Engn, Seoul 156743, South Korea
[2] Seoul Natl Univ, Dept Ind Engn, Seoul, South Korea
来源：
JOURNAL OF SCHEDULING | 2007年 / 10卷 / 4-5期
关键词：
scheduling; just-in-time jobs; NP-complete;
D O I：
10.1007/s10951-007-0030-z
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper we consider the maximization of the weighted number of just-in-time jobs that should be completed exactly on their due dates in n-job, m-machine flow shop problems. We show that a two-machine flow shop problem is NP-complete. When job weights are all identical, we show that the problem can be solved in polynomial time. We also show that a three-machine flow shop problem with identical job weights is NP-hard in the strong sense by reduction of the 3-partition problem.
引用
收藏
页码：237 / 243
页数：7
相关论文
共 50 条
12345