Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
DOI10.1080/00207540410001699381zbMATH Open1060.90654OpenAlexW2170876038MaRDI QIDQ4671306FDOQ4671306
Author name not available (Why is that?)
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
Recommendations
- Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- Scheduling flexible manufacturing cells using tabu search
- A tabu search approach for the flow shop scheduling problem
- FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Tabu Search—Part I
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- Two-Stage, Hybrid Flowshop Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Design and implementation of a course scheduling system using Tabu Search
- 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
- A dynamic tabu search for large-scale generalized assignment problems
- A new heuristic method for the flow shop sequencing problem
- Comparison of iterative improvement techniques for schedule optimization
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
Cited In (13)
- Optimal budget allocation policy for tabu search in stochastic simulation optimization
- Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study
- Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling
- Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
- Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors
- A multi-dimensional tabu search algorithm for the optimization of process planning
- The hybrid flow shop scheduling problem
- Design method using hybrid of line-type and circular-type routes for transit network system optimization
- An optimization approach to the scale of port cold-chain dedicated terminals considering uncertainties
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Capacity-constrained production scheduling of multiple vehicle programs in an automotive pilot plant
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
This page was built for publication: Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4671306)
