Two-machine flow shop total tardiness scheduling problem with deteriorating jobs

被引:14
|
作者
Bank, M. [1 ]
Ghomi, S. M. T. Fatemi [1 ]
Jolai, F. [2 ]
Behnamian, J. [1 ]
机构
[1] Amirkabir Univ Technol, Dept Ind Engn, Tehran 1591634311, Iran
[2] Univ Tehran, Coll Engn, Dept Ind Engn, Tehran, Iran
关键词
Flow shop; Scheduling; Deteriorating job; Branch and bound algorithm; Heuristic algorithm; SIMPLE LINEAR DETERIORATION; DEPENDENT PROCESSING TIMES; IDLE DOMINANT MACHINES; COMPLETION-TIME;
D O I
10.1016/j.apm.2011.12.010
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper studies a two-machine scheduling problem with deteriorating jobs which their processing times depend on their waiting time. We develop a branch and bound algorithm to minimize the total tardiness criteria. A lower bound, several dominance properties and an initial upper bound derived from a heuristic algorithm are used to increase the speed of branch and bound algorithm and decrease its required memory space. Computational results are presented to evaluate effectiveness and efficiency of the algorithms. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:5418 / 5426
页数:9
相关论文
共 50 条
  • [31] Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time
    He, Ning
    Qiao, Yan
    Wu, NaiQi
    Qu, Ting
    [J]. ADVANCES IN MECHANICAL ENGINEERING, 2017, 9 (03) : 1 - 12
  • [32] Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling
    Chen, JS
    Pan, JCH
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2005, 36 (12) : 757 - 766
  • [33] Minimizing Total Tardiness in a Two-Machine Flowshop Scheduling Problem with Availability Constraints
    Rakrouki, Mohamed Ali
    Aljohani, Abeer
    Alharbe, Nawaf
    Berrais, Abdelaziz
    Ladhari, Talel
    [J]. INTELLIGENT AUTOMATION AND SOFT COMPUTING, 2023, 35 (01): : 1119 - 1134
  • [34] The two-machine total completion time flow shop problem
    DellaCroce, F
    Narayan, V
    Tadei, R
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 90 (02) : 227 - 237
  • [35] On three-machine flow shop scheduling with deteriorating jobs
    Wang, Ling
    Sun, Lin-Yan
    Sun, Lin-Hui
    Wang, Ji-Bo
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2010, 125 (01) : 185 - 189
  • [36] Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem
    Shabtay, Dvir
    Gerstl, Enrique
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 316 (03) : 887 - 898
  • [37] Consideration of transportation lags in a two-machine Flow shop scheduling problem
    Jolai, F.
    Abedinnia, H.
    [J]. SCIENTIA IRANICA, 2013, 20 (06) : 2215 - 2223
  • [38] Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine
    Lee, Ju-Yong
    Kim, Yeong-Dae
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 114 : 22 - 30
  • [39] Scheduling the two-machine open shop problem under resource constraints for setting the jobs
    Ammar Oulamara
    Djamal Rebaine
    Mehdi Serairi
    [J]. Annals of Operations Research, 2013, 211 : 333 - 356
  • [40] Fuzzy scheduling on two-machine flow shop
    Hong, TP
    Chuang, TN
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 1998, 6 (04) : 471 - 481