A note on the optimal makespan of a parallel machine scheduling problem

被引：0
|
作者：
Li, Yumei [1 ]
Gu, Yundong [2 ]
Sun, Kaibiao [3 ]
Li, Hongxing [3 ]
机构：
[1] Beijing Technol & Business Univ, Sch Informat Engn, Beijing 100037, Peoples R China
[2] N China Elect Power Univ, Sch Math & Phys, Beijing 102206, Peoples R China
[3] Beijing Normal Univ, Sch Math Sci, Beijing 100875, Peoples R China
来源：
FUZZY INFORMATION AND ENGINEERING, PROCEEDINGS | 2007年 / 40卷
基金：
中国国家自然科学基金;
关键词：
scheduling problem; parallel machine; algorithm; result schedule; optimal makespan;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
For the parallel machine scheduling problem under consideration, the authors in two literatures of 1961 and 2002 respectively gave the proofs for the optimal makespan under Level Algorithm. But, some errors in their proofs are found by us with three counterexamples, and no one has given the correct proof until now. In this paper, a new algorithm is proposed. And the new algorithm is more convenient and easier for theoretical analysis than Level Algorithm does. Then, it is showed that the result schedule obtained by using the new algorithm is consistent with that by Level Algorithm in the sense that they can give the same result schedule. Finally, by using the proposed new algorithm, the proof for the optimal makespan is accomplished.
引用
收藏
页码：481 / +
页数：2
相关论文
共 50 条
  • [21] Identical parallel machine scheduling problem for minimizing the makespan using genetic algorithm combined by simulated annealing
    Liu, M.
    Wu, Ch.
    [J]. Chinese Journal of Electronics, 1998, 7 (04): : 317 - 321
  • [22] A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
    Feng, Qi
    Yuan, Jinjiang
    Liu, Hailing
    He, Cheng
    [J]. APPLIED MATHEMATICAL MODELLING, 2013, 37 (10-11) : 7071 - 7076
  • [23] Minimizing the makespan in a single machine scheduling problem with a flexible maintenance
    Yang, Dar-Li
    Hung, Ching-Lien
    Hsu, Chou-Jung
    Chem, Maw-Sheng
    [J]. Journal of the Chinese Institute of Industrial Engineers, 2002, 19 (01): : 63 - 66
  • [24] Variable Neighborhood Search for Minimizing the Makespan in a Uniform Parallel Machine Scheduling
    Bamatraf, Khaled
    Gharbi, Anis
    [J]. SYSTEMS, 2024, 12 (06):
  • [25] Preemptive Parallel-Machine Scheduling with a Common Server to Minimize Makespan
    Cheng, T. C. E.
    Kravchenko, Svetlana A.
    Lin, Bertrand M. T.
    [J]. NAVAL RESEARCH LOGISTICS, 2017, 64 (05) : 388 - 398
  • [26] Parallel machine scheduling for minimizing the makespan and the average flow-time
    Ruiz-Torres, AJ
    Enscore, EE
    Barton, RR
    [J]. 6TH INDUSTRIAL ENGINEERING RESEARCH CONFERENCE PROCEEDINGS: (IERC), 1997, : 186 - 191
  • [27] Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
    Ruiz-Torres, Alex J.
    Paletta, Giuseppe
    Perez, Eduardo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (08) : 2051 - 2061
  • [28] Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    Li, Ya
    [J]. INFORMATION PROCESSING LETTERS, 2014, 114 (04) : 179 - 184
  • [29] An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
    Fu, Ruyan
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    [J]. OPERATIONS RESEARCH LETTERS, 2013, 41 (03) : 216 - 219
  • [30] A PARALLEL ALGORITHM FOR THE MACHINE SCHEDULING PROBLEM
    NAKAMORI, M
    [J]. LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1988, 113 : 299 - 306
12345