Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study

DOI10.1080/00207540410001699381zbMath1060.90654OpenAlexW2170876038MaRDI QIDQ4671306

No author found.

Publication date: 26 April 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540410001699381

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, An optimization approach to the scale of port cold-chain dedicated terminals considering uncertainties, Design method using hybrid of line-type and circular-type routes for transit network system optimization, Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors, Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling, The hybrid flow shop scheduling problem, Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study, Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines, A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines, Capacity-constrained production scheduling of multiple vehicle programs in an automotive pilot plant, Optimal budget allocation policy for tabu search in stochastic simulation optimization

Cites Work

• A new heuristic method for the flow shop sequencing problem
• A simple tabu search method to solve the mixed-integer linear bilevel programming problem
• Comparison of iterative improvement techniques for schedule optimization
• A tabu search approach for the flow shop scheduling problem
• Genetic algorithms and tabu search: Hybrids for optimization
• Local search algorithms for the multiprocessor flow shop scheduling problem
• Design and implementation of a course scheduling system using Tabu Search
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Tabu Search—Part I
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A dynamic tabu search for large-scale generalized assignment problems