On some lower bounds for the permutation flowshop problem

被引：1
|
作者：
Gelvez, Sebastian Caceres [1 ,2 ]
Dang, Thu Huong [1 ]
Letchford, Adam N. [1 ]
机构：
[1] Lancaster Univ Management Sch, Dept Management Sci, Lancaster, England
[2] Univ Santander, Fac Ingn, Grp Invest EUREKA UDES, Cucuta, Colombia
来源：
COMPUTERS & OPERATIONS RESEARCH | 2023年 / 159卷
基金：
英国工程与自然科学研究理事会;
关键词：
Flowshop scheduling; Permutation flowshops; Lower bounds; INTEGER PROGRAMMING FORMULATIONS; ALGORITHM;
D O I：
10.1016/j.cor.2023.106320
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The permutation flowshop problem with makespan objective is a classic machine scheduling problem, known to be NP-hard in the strong sense. We analyse some of the existing lower bounds for the problem, including the "job-based"and "machine-based"bounds, a bound from linear programming (LP), and a recent bound of Kumar and co-authors. We show that the Kumar et al. bound dominates the machine-based bound, but the LP bound is stronger still. On the other hand, the LP bound does not, in general, dominate the job-based bound. Based on this, we devise simple iterative procedures for strengthening the Kumar et al. and LP bounds. Computational results are encouraging. In particular, we are able to obtain improved lower bounds for the "hard, small"instances of Vallada, Ruiz and Framinan.
引用
收藏
页数：9
相关论文
共 50 条
  • [41] The distributed permutation flowshop scheduling problem: A genetic algorithm approach
    Li, Yan
    Chen, Zhigang
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MECHATRONICS AND INDUSTRIAL INFORMATICS, 2015, 31 : 381 - 384
  • [42] A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem
    Gao, Jian
    Chen, Rong
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2011, 4 (04) : 497 - 508
  • [43] Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
    Silva, Andreia F.
    Valente, Jorge M. S.
    Schaller, Jeffrey E.
    COMPUTERS & OPERATIONS RESEARCH, 2022, 140
  • [44] A genetic algorithm for the distributed assembly permutation flowshop scheduling problem
    Li, Xiangtao
    Zhang, Xin
    Yin, Minghao
    Wang, Jianan
    2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 3096 - 3101
  • [45] Iterated Greedy methods for the distributed permutation flowshop scheduling problem
    Ruiz, Ruben
    Pan, Quan-Ke
    Naderi, Bahman
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2019, 83 : 213 - 222
  • [46] Fitness Landscape of the Factoradic Representation on the Permutation Flowshop Scheduling Problem
    Marmion, Marie-Eleonore
    Regnier-Coudert, Olivier
    LEARNING AND INTELLIGENT OPTIMIZATION, LION 9, 2015, 8994 : 151 - 164
  • [47] Particle swarm optimization algorithm for permutation flowshop sequencing problem
    Tasgetiren, MF
    Sevkli, M
    Liang, YC
    Gencyilmaz, G
    ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2004, 3172 : 382 - 389
  • [48] An Effective Evolutionary Hybrid for Solving the Permutation Flowshop Scheduling Problem
    Amirghasemi, Mehrdad
    Zamani, Reza
    EVOLUTIONARY COMPUTATION, 2017, 25 (01) : 87 - 111
  • [49] Pixelation of time matrices for solving permutation flowshop scheduling problem
    Rad, Shahriar Farahmand
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024, 62 (23) : 8505 - 8517
  • [50] A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem
    Gao J.
    Chen R.
    International Journal of Computational Intelligence Systems, 2011, 4 (4) : 497 - 508
12345