A Heuristic Algorithm for Maximizing the Total Weight of Just-In-Time Jobs Under Multi-Slot Conditions

被引：0
|
作者：
Saito, R. [1 ]
Chiba, E. [2 ]
机构：
[1] Hosei Univ, Sch Sci & Engn, Koganei, Tokyo, Japan
[2] Hosei Univ, Dept Ind & Syst Engn, Koganei, Tokyo, Japan
来源：
2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM) | 2016年
关键词：
Heuristics; just-in-time; scheduling; time slot;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Maximizing the total weight of just-in-time jobs under multi-slot conditions was proven recently to be NP hard. We consider a heuristic algorithm for this problem. First, we compute a schedule that minimizes the number of time slots. Next, we make a new set of jobs by merging existing jobs in the schedule. Then, we compute a minimum cost flow for the network constructed from this new set of jobs. Finally, we obtain a feasible schedule from the flow. Moreover, we implement the heuristic algorithm, and consider its features and performance from the computational experimentation.
引用
收藏
页码：84 / 88
页数：5
相关论文
共 50 条
  • [1] Maximizing the Total Weight of Just-In-Time Jobs under Multi-Slot Conditions Is NP-Hard
    Chiba, Eishi
    Imahori, Shinji
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2016, E99D (02) : 525 - 528
  • [2] 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
  • [3] Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
    Dereniowski, Dariusz
    Kubiak, Wieslaw
    JOURNAL OF SCHEDULING, 2010, 13 (05) : 479 - 492
  • [4] Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
    Dariusz Dereniowski
    Wiesław Kubiak
    Journal of Scheduling, 2010, 13 : 479 - 492
  • [5] A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines
    F. Jolai
    M. S. Amalnick
    M. Alinaghian
    M. Shakhsi-Niaei
    H. Omrani
    Journal of Intelligent Manufacturing, 2011, 22 : 247 - 261
  • [6] A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines
    Jolai, F.
    Amalnick, M. S.
    Alinaghian, M.
    Shakhsi-Niaei, M.
    Omrani, H.
    JOURNAL OF INTELLIGENT MANUFACTURING, 2011, 22 (02) : 247 - 261
  • [7] Maximizing weighted number of just-in-time jobs on unrelated parallel machines
    Sung, SC
    Vlach, M
    JOURNAL OF SCHEDULING, 2005, 8 (05) : 453 - 460
  • [8] Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines
    Shao Chin Sung
    Milan Vlach
    Journal of Scheduling, 2005, 8 : 453 - 460
  • [9] Maximizing the weighted number of just-in-time jobs in flow shop scheduling
    Choi, Byung-Cheon
    Yoon, Suk-Hun
    JOURNAL OF SCHEDULING, 2007, 10 (4-5) : 237 - 243
  • [10] A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
    Gerstl, Enrique
    Mor, Baruch
    Mosheiov, Gur
    INFORMATION PROCESSING LETTERS, 2015, 115 (02) : 159 - 162
12345