A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines

被引：15
|
作者：
Sun, Linhui [2 ]
Sun, Linyan [2 ]
Cui, Kai [2 ]
Wang, Ji-Bo [1 ]
机构：
[1] Shenyang Inst Aeronaut Engn, Sch Sci, Shenyang 110136, Peoples R China
[2] Xi An Jiao Tong Univ, Sch Management, State Key Lab Mfg Syst Engn, Xian 710049, Peoples R China
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2010年 / 200卷 / 01期
关键词：
Scheduling; Flow shop; Deteriorating jobs; Dominant machines; DEPENDENT PROCESSING TIMES; TOTAL COMPLETION-TIME; LINEAR DETERIORATION; MINIMIZE;
D O I：
10.1016/j.ejor.2008.12.029
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The main results in a recent paper [M. Cheng, S. Sun, L He, Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines, European journal of Operational Research 183 (2007) 115-124] are incorrect because job processing times are variable due to deteriorating effect, which is not taken into account by the authors. In this note, we show first by counter-examples that the published results are incorrect, and then we provide corrected results. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：309 / 311
页数：3
相关论文
共 50 条
  • [21] A note on scheduling deteriorating jobs
    Mosheiov, G
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 2005, 41 (8-9) : 883 - 886
  • [22] Mixed no-idle permutation flow shop scheduling problem based on gravitational search algorithm
    Zhao R.
    Gu X.
    [J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (07): : 1909 - 1917
  • [23] No-idle Parallel Machine Scheduling of Unit-time Jobs
    Brauner, Nadia
    Kovalyov, Mikhail Y.
    Quilliot, Alain
    Toussaint, Helene
    [J]. 2019 6TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT 2019), 2019, : 807 - 811
  • [24] Flow shop scheduling problems with decreasing linear deterioration under dominant machines
    Wang, Ji-Bo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (07) : 2043 - 2058
  • [25] No-wait flexible flowshop scheduling with no-idle machines
    Wang, ZB
    Xing, WX
    Bai, FS
    [J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 609 - 614
  • [26] Solving Permutation Flow Shop Scheduling Problems with Job Idle Time in between Two Machines
    Baskar, A.
    Xavior, Anthony M.
    [J]. MATERIALS SCIENCE AND NANOTECHNOLOGY I, 2013, 531-532 : 699 - 702
  • [27] A note on "minimizing makespan in three machine flow shop with deteriorating jobs"
    Jafari, Abbas-Ali
    Khademi-Zare, Hassan
    Lotfi, M. M.
    Tavakkoli-Moghaddam, Reza
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2016, 72 : 93 - 96
  • [28] The flow shop problem with no-idle constraints: A review and approximation
    Goncharov, Yaroslav
    Sevastyanov, Sergey
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 196 (02) : 450 - 456
  • [29] An algorithm based on discrete shuffled frog leaping for No-idle permutation flow shop scheduling problem
    Wang, Ya-Min
    Ji, Jun-Zhong
    Pan, Quan-Ke
    [J]. Beijing Gongye Daxue Xuebao / Journal of Beijing University of Technology, 2010, 36 (01): : 124 - 130
  • [30] No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm
    Pan, Quan-Ke
    Wang, Ling
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 39 (7-8): : 796 - 807
12345