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

DOI10.1007/s10732-010-9155-xzbMath1358.90003OpenAlexW2081802723MaRDI QIDQ519086

Andreas Fink, Jens Czogalla

Publication date: 4 April 2017

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-010-9155-x

zbMATH Keywords

evolutionary computationcombinatorial optimization problemfitness landscape analysisno-wait (continuous) flow-shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Stochastic local search and parameters recommendation: a case study on flowshop problems, A survey of scheduling problems with no-wait in process

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of metrics on permutations for search landscape analysis
• The longest common subsequence problem revisited
• Landscapes, operators and heuristic search
• A new adaptive multi-start technique for combinatorial global optimizations
• A genetic algorithm for flowshop sequencing
• Landscapes and their correlation functions
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• Benchmarks for basic scheduling problems
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
• A note on the flow-shop problem without interruptions in job processing
• Heuristic algorithms for continuous flow-shop problem
• Flowshop scheduling with limited temporary storage
• Unit Execution Time Shop Problems
• Solvable Cases of the No-wait Flow-shop Scheduling Problem
• Optimal flowshop schedules with no intermediate storage space
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Ordonnancements à contraintes disjonctives
• Algorithms for the Longest Common Subsequence Problem
• The String-to-String Correction Problem
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem
• Evolutionary Computation in Combinatorial Optimization