A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines

被引：21
|
作者：
Cepek, O
Sung, SC
机构：
[1] Charles Univ, Dept Theoret Informat & Math Log, Prague 111800 1, Czech Republic
[2] Japan Adv Inst Sci & Technol, Sch Informat Sci, Tatsunokuchi, Ishikawa 9231292, Japan
来源：
COMPUTERS & OPERATIONS RESEARCH | 2005年 / 32卷 / 12期
关键词：
scheduling; identical parallel machines; just-in-time jobs;
D O I：
10.1016/j.cor.2004.05.011
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we study a scheduling problem on identical parallel machines, in which a processing time and a due date are given for each job, and the objective is to maximize the number of just-in-time jobs. A job is called just-in-time if it is completed exactly on its due date. We discuss the known results, show that a recently published greedy algorithm for this problem is incorrect, and present a new quadratic time algorithm which solves the problem. (c) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码：3265 / 3271
页数：7
相关论文
共 50 条
  • [1] Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
    Hiraishi, K
    Levner, E
    Vlach, M
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (07) : 841 - 848
  • [2] Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines
    Shao Chin Sung
    Milan Vlach
    [J]. Journal of Scheduling, 2005, 8 : 453 - 460
  • [3] Maximizing weighted number of just-in-time jobs on unrelated parallel machines
    Sung, SC
    Vlach, M
    [J]. JOURNAL OF SCHEDULING, 2005, 8 (05) : 453 - 460
  • [4] 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
    [J]. Journal of Intelligent Manufacturing, 2011, 22 : 247 - 261
  • [5] 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.
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2011, 22 (02) : 247 - 261
  • [6] 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.
    [J]. 2012 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2012, : 1349 - 1353
  • [7] A note on the maximum number of on-time jobs on parallel identical machines
    Lann, A
    Mosheiov, G
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (11) : 1745 - 1749
  • [8] Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
    Yin, Yunqiang
    Cheng, T. C. E.
    Wang, Du-Juan
    Wu, Chin-Chia
    [J]. JOURNAL OF SCHEDULING, 2017, 20 (04) : 313 - 335
  • [9] Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
    Yunqiang Yin
    T. C. E. Cheng
    Du-Juan Wang
    Chin-Chia Wu
    [J]. Journal of Scheduling, 2017, 20 : 313 - 335
  • [10] A SEARCH HEURISTIC FOR JUST-IN-TIME SCHEDULING IN PARALLEL MACHINES
    LAGUNA, M
    VELARDE, JLG
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 1991, 2 (04) : 253 - 260
12345