Fitness landscape analysis for the no-wait flow-shop scheduling problem

被引：17
作者：
Czogalla, Jens [1 ]
Fink, Andreas [1 ]
机构：
[1] Helmut Schmidt Univ, Holstenhofweg 85, D-22043 Hamburg, Germany
来源：
JOURNAL OF HEURISTICS | 2012年 / 18卷 / 01期
关键词：
Evolutionary computation; Combinatorial optimization problem; No-wait (continuous) flow-shop scheduling; Fitness landscape analysis; PARTICLE SWARM OPTIMIZATION; DISTANCE MEASURES; ALGORITHMS; SHOP; MINIMIZE;
D O I：
10.1007/s10732-010-9155-x
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The fitness landscape of the no-wait (continuous) flow-shop scheduling problem is investigated by examining the ruggedness of the landscape and the correlation between the quality of a solution and its distance to an optimal solution. The results confirm the presence of a big valley structure as known from other combinatorial optimization problems. The suitability of the landscape for search with evolutionary computation and local search methods is discussed. The observations are validated by experiments with two evolutionary algorithms.
引用
收藏
页码：25 / 51
页数：27
相关论文
共 50 条
[31]   Makespan Minimization in Two-Machine Flow-Shop Scheduling under No-wait and Deterministic Unavailable Interval Constraints [J].
Chen, Kejia ;
Li, Debiao ;
Wang, Xiao .
JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 2020, 29 (04) :400-411
[32]   Permutation flow-shop scheduling problem to optimize a quadratic objective function [J].
Ren, Tao ;
Zhao, Peng ;
Zhang, Da ;
Liu, Bingqian ;
Yuan, Huawei ;
Bai, Danyu .
ENGINEERING OPTIMIZATION, 2017, 49 (09) :1589-1603
[33]   A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time [J].
Akhshabi, M. ;
Tavakkoli-Moghaddam, R. ;
Rahnamay-Roodposhti, F. .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 70 (5-8) :1181-1188
[34]   A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time [J].
M. Akhshabi ;
R. Tavakkoli-Moghaddam ;
F. Rahnamay-Roodposhti .
The International Journal of Advanced Manufacturing Technology, 2014, 70 :1181-1188
[35]   Research on No-wait Flow Shop Scheduling Problem with Fuzzy Due Date Based on Evolution Games [J].
Zhou, Yanping ;
Gu, Xingsheng .
2009 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 3, 2009, :490-494
[36]   An effective co-evolutionary quantum genetic algorithm for the no-wait flow shop scheduling problem [J].
Deng, Guanlong ;
Wei, Ming ;
Su, Qingtang ;
Zhao, Mei .
ADVANCES IN MECHANICAL ENGINEERING, 2015, 7 (12)
[37]   Reentrant open shop scheduling problem with time lags and no-wait constraints [J].
Alioui, Kenza ;
Amrouche, Karim ;
Boudhar, Mourad .
COMPUTERS & OPERATIONS RESEARCH, 2024, 166
[38]   A discrete Jaya algorithm for permutation flow-shop scheduling problem [J].
Mishra, Aseem K. ;
Pandey, Divya .
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2020, 11 (03) :415-428
[39]   No-wait Flow Shop Scheduling based on Discrete Harmony Search Algorithm [J].
Sun Qiang-qiang ;
Dong Bin .
APPLIED SCIENCE, MATERIALS SCIENCE AND INFORMATION TECHNOLOGIES IN INDUSTRY, 2014, 513-517 :1523-+
[40]   An effective hybrid particle swarm optimization for no-wait flow shop scheduling [J].
Liu, Bo ;
Wang, Ling ;
Jin, Yi-Hui .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 31 (9-10) :1001-1011
12345