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 条

[1] LOWER BOUNDS IN PERMUTATION FLOWSHOP PROBLEMS
BANSAL, SP
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1979, 17 (04) : 411 - 418
[2] Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
Hamdi, Imen
Loukil, Taicir
OPTIMIZATION LETTERS, 2015, 9 (03) : 465 - 482
[3] Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
Imen Hamdi
Taïcir Loukil
Optimization Letters, 2015, 9 : 465 - 482
[4] New upper bounds for the permutation flowshop scheduling problem
Jedrzejowicz, J
Jedrzejowicz, P
INNOVATIONS IN APPLIED ARTIFICIAL INTELLIGENCE, 2005, 3533 : 232 - 235
[5] Development of different lower bounds for group scheduling problem on flowshop
Chang, Pei-Chann
Kung Yeh Kung Chieng Hsueh K'an/Journal of the Chinese Institute of Industrial Engineers, 1995, 12 (01):
[6] SIMULATED ANNEALING FOR THE PERMUTATION FLOWSHOP PROBLEM
OGBU, FA
SMITH, DK
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1991, 19 (01): : 64 - 67
[7] The distributed permutation flowshop scheduling problem
Naderi, B.
Ruiz, Ruben
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (04) : 754 - 768
[8] Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness
Hamdi, Imen
Loukil, Taicir
INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2014, 5 (02): : 47 - 57
[9] Heuristics in Permutation GOMEA for Solving the Permutation Flowshop Scheduling Problem
Aalvanger, G. H.
Luong, N. H.
Bosman, P. A. N.
Thierens, D.
PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XV, PT I, 2018, 11101 : 146 - 157
[10] New scheduling heuristic for the permutation flowshop problem
Beijing Univ of Aeronautics and, Astronautics, Beijing, China
Beijing Hangkong Hangtian Daxue Xuebao, 1 (83-87):

← 1 2 3 4 5 →