A branch-and-bound approach to the no-idle flowshop scheduling problem

被引：0
|
作者：
Jarboui, Bassem [1 ]
Eddaly, Mansour [2 ]
机构：
[1] Univ Polytech Hauts Defrance, LAMIH, CNRS, UMR 8201, F-59313 Valenciennes, France
[2] Qassim Univ, Coll Business & Econ, Dept Management Informat Syst & Prod Management, Buraydah 52571, Saudi Arabia
来源：
DISCRETE APPLIED MATHEMATICS | 2024年 / 347卷
关键词：
Branch and bound; Machine based lower bounds; Iterated local search; No-idle flowshop scheduling problem; ITERATED GREEDY ALGORITHM; DIFFERENTIAL EVOLUTION; TOTAL TARDINESS; MINIMIZE; TIME;
D O I：
10.1016/j.dam.2024.01.022
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper addresses to the problem of flowshop scheduling under no-idle constraints with respect to the total completion time criterion. A branch and bound algorithm is proposed and a machine based lower bound is developed for the first time in the literature of this problem. Moreover, an Iterated Local Search (ILS) algorithm is used to provide the upper bounds of the problem. The computational results are promising, and the proposed algorithm appears able to find optimal solutions to problems with up to 20 jobs and 4 machines.
引用
收藏
页码：297 / 310
页数：14
相关论文
共 50 条
  • [1] A BRANCH-AND-BOUND APPROACH FOR A 2-MACHINE FLOWSHOP SCHEDULING PROBLEM
    NAGAR, A
    HERAGU, SS
    HADDOCK, J
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1995, 46 (06) : 721 - 734
  • [2] A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem
    Nagar, A
    Heragu, SS
    Haddock, J
    [J]. ANNALS OF OPERATIONS RESEARCH, 1996, 63 : 397 - 414
  • [3] A new branch-and-bound approach for the n/2/flowshop/αF+βCmax flowshop scheduling problem
    Yeh, WC
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (13) : 1293 - 1310
  • [4] Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
    Tolga Bektaş
    Alper Hamzadayı
    Rubén Ruiz
    [J]. Journal of Scheduling, 2020, 23 : 513 - 523
  • [5] A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
    Cheng, JL
    Kise, H
    Matsumoto, H
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) : 578 - 590
  • [6] The distributed no-idle permutation flowshop scheduling problem with due windows
    Mousighichi, Kasra
    Avci, Mualla Gonca
    [J]. COMPUTATIONAL & APPLIED MATHEMATICS, 2024, 43 (04):
  • [7] Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
    Bektas, Tolga
    Hamzadayi, Alper
    Ruiz, Ruben
    [J]. JOURNAL OF SCHEDULING, 2020, 23 (04) : 513 - 523
  • [8] Flowshop/no-idle scheduling to minimise the mean flowtime
    Narain, L
    Bagga, PC
    [J]. ANZIAM JOURNAL, 2005, 47 : 265 - 275
  • [9] An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem
    Pan, Quan-Ke
    Ruiz, Ruben
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2014, 44 : 41 - 50
  • [10] A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
    Tasgetiren, M. Fatih
    Pan, Quan-Ke
    Suganthan, P. N.
    Chua, Tay Jin
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (16) : 5033 - 5050
12345