A tabu-search heuristic for the flexible-resource flow shop scheduling problem

DOI10.1007/BF02023075zbMath0771.90055OpenAlexW1983457098MaRDI QIDQ2367002

Joseph B. Mazzola, Richard L. Daniels

Publication date: 16 August 1993

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

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

zbMATH Keywords

tabu search heuristicflexible-resource flow shop scheduling

Mathematics Subject Classification ID

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

Related Items (6)

Genetic algorithms and tabu search: Hybrids for optimization ⋮ A tabu search algorithm for frequency assignment ⋮ Metaheuristics: A bibliography ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ Throughput optimization in two-machine flowshops with flexible operations ⋮ A tabu search approach to machine scheduling

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Some efficient heuristic methods for the flow shop sequencing problem
• A new integer programming formulation for the permutation flowshop problem
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics
• A user's guide to tabu search
• A tabu search experience in production scheduling
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• A Comparative Study of Flow-Shop Algorithms
• An Evaluation of Flow Shop Sequencing Heuristics
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• The Complexity of Flowshop and Jobshop Scheduling
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

This page was built for publication: A tabu-search heuristic for the flexible-resource flow shop scheduling problem