Local search algorithms for the multiprocessor flow shop scheduling problem

DOI10.1016/S0377-2217(99)00354-9zbMath0984.90017MaRDI QIDQ1592744

Ebbe G. Negenman

Publication date: 14 May 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealing; tabu search; flow shop; local search algorithms; sheduling; variable-depth search

Mathematics Subject Classification ID

90B40: Search theory

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study, Flowshop-scheduling problems with makespan criterion: a review, Genetic algorithms and simulated annealing for scheduling in agile manufacturing, A taxonomy of flexible flow line scheduling procedures, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, Heuristic factory planning algorithm for advanced planning and scheduling, A genetic algorithm for the proportionate multiprocessor open shop, A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, A heuristic algorithm for the hospital health examination scheduling problem, An integrated approach for modeling and solving the scheduling problem of container handling systems

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• A fast tabu search algorithm for the permutation flow-shop problem
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• A user's guide to tabu search
• Routing and scheduling in a flexible job shop by tabu search
• Tabu Search—Part I
• Tabu Search—Part II
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Fast Taboo Search Algorithm for the Job Shop Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem