A comparison of local search methods for flow shop scheduling

DOI10.1007/BF02156631zbMath0851.90064OpenAlexW2033048077MaRDI QIDQ1919857

Chris N. Potts, Celia A. Dr. Glass

Publication date: 28 July 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02156631

zbMATH Keywords

approximate solutionssimulated annealingtabu searchgenetic algorithmslocal searchthreshold acceptingpermutation flow shophybrid methodtotal weighted completion timeneighbourhood search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (6)

Metaheuristics: A bibliography ⋮ Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ Local search heuristics for two-stage flow shop problems with secondary criterion ⋮ A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size ⋮ Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• On the heuristic solution of the permutation flow shop problem by path algorithms
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Simulated annealing: A tool for operational research
• Some efficient heuristic methods for the flow shop sequencing problem
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Evolution algorithms in combinatorial optimization
• A new heuristic method for the flow shop sequencing problem
• Unrelated parallel machine scheduling using local search
• A genetic algorithm for flowshop sequencing
• A genetic algorithm for the job shop problem
• Evolution based learning in a job shop scheduling environment
• The tabu search metaheuristic: How we used it
• Genetic algorithms: Foundations and applications
• Future paths for integer programming and links to artificial intelligence
• Heuristics for scheduling unrelated parallel machines
• Benchmarks for basic scheduling problems
• Applying tabu search to the job-shop scheduling problem
• Convergence of an annealing algorithm
• Job Shop Scheduling by Simulated Annealing
• Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
• The Complexity of Flowshop and Jobshop Scheduling
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Heuristic-Programming Solution of a Flowshop-Scheduling Problem
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems

This page was built for publication: A comparison of local search methods for flow shop scheduling