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

DOI10.1007/BF02023075MaRDI QIDQ2367002zbMATH OpenOpenAlexFDO

Authors Richard L. Daniels, Joseph B. Mazzola

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

flexible-resource flow shop schedulingtabu search heuristic

Mathematics Subject Classification ID

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

Recommendations

• An analysis of heuristics for the parallel-machine flexible-resource scheduling problem
• A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
• A tabu search approach for the flow shop scheduling problem
• Tabu search for resource-constrained scheduling

Cites work

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

Cited in

(19)

• Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
• Genetic algorithms and tabu search: Hybrids for optimization
• An analysis of heuristics for the parallel-machine flexible-resource scheduling problem
• Tabu search for resource-constrained scheduling
• A tabu search approach to machine scheduling
• A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
• A neuro-tabu search heuristic for the flow shop scheduling problem
• 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
• Flow shop scheduling with partial resource flexibility
• A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
• scientific article; zbMATH DE number 1488079 (Why is no real title available?)
• Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
• Throughput optimization in two-machine flowshops with flexible operations
• Shifting representation search for hybrid flexible flowline problems

Describes a project that uses

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367002)