Flow Shop Scheduling with Shortening Jobs for Makespan Minimization

被引：1
|
作者：
Sun, Zheng-Wei [1 ]
Lv, Dan-Yang [2 ,3 ]
Wei, Cai-Min [4 ]
Wang, Ji-Bo [1 ]
机构：
[1] Shenyang Aerosp Univ, Sch Comp, Shenyang 110136, Peoples R China
[2] Shenyang Aerosp Univ, Sch Mechatron Engn, Shenyang 110136, Peoples R China
[3] Shenyang Aerosp Univ, Key Lab Rapid Dev & Mfg Technol Aircraft, Minist Educ, Shenyang 110136, Peoples R China
[4] Shantou Univ, Sch Math & Comp, Shantou 515063, Peoples R China
来源：
MATHEMATICS | 2025年 / 13卷 / 03期
关键词：
scheduling; flow shop; shortening job; makespan; branch-and-bound algorithm; heuristic algorithm; TOTAL COMPLETION-TIME; SOLUTION ALGORITHMS; DETERIORATING JOBS; COMPLEXITY;
D O I：
10.3390/math13030363
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This paper deals with a two-machine flow shop problem with shortening jobs. A shortening job means that the job's processing time is a decreasing function of its starting time. The aim is to find a sequence that minimizes the makespan of all the jobs. several dominance properties, some lower bounds, and an initial upper bound are derived, which are applied to propose a branch-and-bound algorithm to solve the problem. We also propose some heuristics and mathematical programming. Computational experiments are conducted to evaluate the performance of the proposed algorithms.
引用
收藏
页数：23
相关论文
共 50 条
  • [41] Flow shop scheduling with jobs arriving at different times
    Li, Guo
    Li, Na
    Sambandam, Narayanasamy
    Sethi, Suresh P.
    Zhang, Faping
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2018, 206 : 250 - 260
  • [42] Makespan minimization for scheduling on two identical parallel machiens with flexible maintenance and nonresumable jobs
    Chen, Ya-Yong
    Huang, Pei-Yu
    Huang, Cheng-Jun
    Huang, Shen-Quan
    Chou, Fuh-Der
    JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2021, 38 (04) : 271 - 284
  • [43] Exact distribution of the makespan in a two machines flow shop with two kinds of jobs
    Baptiste, P
    Jacquemard, C
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 74 (1-3) : 77 - 83
  • [44] Flow shop scheduling with multiple objective of minimizing makespan and total flow time
    D. Ravindran
    S.J. Selvakumar
    R. Sivaraman
    A. Noorul Haq
    The International Journal of Advanced Manufacturing Technology, 2005, 25 : 1007 - 1012
  • [45] Flow shop scheduling with multiple objective of minimizing makespan and total flow time
    Ravindran, D
    Haq, AN
    Selvakuar, SJ
    Sivaraman, R
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2005, 25 (9-10): : 1007 - 1012
  • [46] A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization
    Seyda Topaloglu
    Gamze Kilincli
    The International Journal of Advanced Manufacturing Technology, 2009, 44 : 781 - 794
  • [47] A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization
    Topaloglu, Seyda
    Kilincli, Gamze
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 44 (7-8): : 781 - 794
  • [48] Scheduling parallel jobs to minimize the makespan
    Johannes, Berit
    JOURNAL OF SCHEDULING, 2006, 9 (05) : 433 - 452
  • [49] Scheduling deteriorating jobs to minimize makespan
    Kubiak, W
    van de Velde, S
    NAVAL RESEARCH LOGISTICS, 1998, 45 (05) : 511 - 523
  • [50] Scheduling parallel jobs to minimize the makespan
    Berit Johannes
    Journal of Scheduling, 2006, 9 : 433 - 452
12345