A tabu search approach for the flow shop scheduling problem
From MaRDI portal
Publication:1296693
DOI10.1016/S0377-2217(97)00136-7zbMath0949.90037OpenAlexW1975130490MaRDI QIDQ1296693
Publication date: 2 August 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00136-7
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A neuro-tabu search heuristic for the flow shop scheduling problem, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation, A multi-objective particle swarm for a flow shop scheduling problem, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, Two-machine flow shop problems with a single server, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect, Hybrid flow-shop scheduling problems with multiprocessor task systems., The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure., Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs., Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm, Parallel hybrid heuristics for the permutation flow shop problem, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, Scheduling in flowshops to minimize total tardiness of jobs, Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study, A comprehensive review and evaluation of permutation flowshop heuristics, An improved genetic algorithm for the flowshop scheduling problem, Permutation flow shop scheduling with earliness and tardiness penalties, Flowshop-scheduling problems with makespan criterion: a review, Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- A decision support system for the resource constrained project scheduling problem
- A new heuristic for the n-job, M-machine flow-shop problem
- Benchmarks for basic scheduling problems
- A user's guide to tabu search
- Optimal two- and three-stage production schedules with setup times included
- Tabu Search—Part I
- Tabu Search—Part II
- On general routing problems
- An Evaluation of Flow Shop Sequencing Heuristics
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
