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 条
  • [41] Dock-to-shop is just-in-time
    McBride, M
    Harrison, S
    Clark, B
    IIE SOLUTIONS, 2000, 32 (09): : 34 - 38
  • [42] A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
    Cepek, O
    Sung, SC
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (12) : 3265 - 3271
  • [43] An Improved Genetic Algorithm For Just-In-Time Job-Shop Scheduling Problem
    Yang, Hongan
    Li, Jinyuan
    Qi, Liangliang
    ADVANCED MANUFACTURING TECHNOLOGY, PTS 1-4, 2012, 472-475 : 2462 - 2467
  • [44] SCHEDULING FOR JUST-IN-TIME MANUFACTURING
    EGBELU, PJ
    WANG, HP
    ENGINEERING COSTS AND PRODUCTION ECONOMICS, 1989, 16 (02): : 117 - 124
  • [45] Research on Just-In-Time scheduling
    Endo, Yoshihiro
    Watanabe, Kajiro
    Eishi-Chiba
    Kurihara, Yousuke
    2012 PROCEEDINGS OF SICE ANNUAL CONFERENCE (SICE), 2012, : 447 - 452
  • [46] Genetic Algorithm and Local Search for Just-in-Time Job-Shop Scheduling
    Araujo, Rodolfo Pereira
    dos Santos, Andre Gustavo
    Claudio Arroyo, Jose Elias
    2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 955 - 961
  • [47] Maximizing the Total Weight Value of Just-In-Time Jobs in Identical Parallel Machines with Periodic Time Slots
    Chiba, E.
    Kageyama, T.
    Karuno, Y.
    Goto, H.
    2012 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2012, : 1349 - 1353
  • [48] Minimizing the weighted number of tardy jobs on a two-machine flow shop
    Bulfin, RL
    M'Hallah, R
    COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (12) : 1887 - 1900
  • [49] Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm
    Desprez, C.
    Chu, F.
    Chu, C.
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2009, 22 (08) : 745 - 757
  • [50] Two-Machine Flow Shop Scheduling with Common Due Window to Minimize Weighted Number of Early and Tardy Jobs
    Yeung, Wing-Kwan
    Oguz, Ceyda
    Cheng, Tai-Chiu Edwin
    NAVAL RESEARCH LOGISTICS, 2009, 56 (07) : 593 - 599
12345