Local search algorithms for the multiprocessor flow shop scheduling problem
From MaRDI portal
Publication:1592744
DOI10.1016/S0377-2217(99)00354-9zbMath0984.90017OpenAlexW2098365734MaRDI QIDQ1592744
Publication date: 14 May 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00354-9
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (18)
A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Integrated cost optimization in a two-stage, automotive supply chain ⋮ A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal ⋮ A heuristic algorithm for the hospital health examination scheduling problem ⋮ A variable depth search branching ⋮ Two-stage hybrid flow shop with recirculation ⋮ Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study ⋮ The hybrid flow shop scheduling problem ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study ⋮ An integrated approach for modeling and solving the scheduling problem of container handling systems ⋮ Heuristic factory planning algorithm for advanced planning and scheduling ⋮ A genetic algorithm for the proportionate multiprocessor open shop ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Genetic algorithms and simulated annealing for scheduling in agile manufacturing
Uses Software
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
This page was built for publication: Local search algorithms for the multiprocessor flow shop scheduling problem
