A tabu search approach for the flow shop scheduling problem
From MaRDI portal
(Redirected from Publication:1296693)
Recommendations
- A fast tabu search algorithm for the permutation flow-shop problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Tabu search for total tardiness minimization in flowshop scheduling problems
- The flow shop with parallel machines: A tabu search approach
- scientific article; zbMATH DE number 1488079
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine 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
- A new heuristic method for the flow shop sequencing problem
- A user's guide to tabu search
- An Evaluation of Flow Shop Sequencing Heuristics
- Benchmarks for basic scheduling problems
- On general routing problems
- Optimal two- and three-stage production schedules with set-up time included
- Some efficient heuristic methods for the flow shop sequencing problem
- Tabu Search—Part I
- Tabu Search—Part II
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
Cited in
(41)- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Parallel flowshop scheduling using Tabu search
- Solving multi-objective production scheduling problems with tabu search
- A tabu search algorithm for the open shop problem
- A pruning pattern list approach to the permutation flowshop scheduling problem.
- A neuro-tabu search heuristic for the flow shop scheduling problem
- Flowshop-scheduling problems with makespan criterion: a review
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
- Scheduling in flowshops to minimize total tardiness of jobs
- An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
- An improved genetic algorithm for the flowshop scheduling problem
- Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem
- Two-machine flow shop problems with a single server
- A tabu search algorithm for a pipe-processing flowshop scheduling problem minimizing total tardiness in a shipyard
- Restricted neighborhood in the tabu search for the flowshop problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A fast tabu search algorithm for the group shop scheduling problem
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A multi-objective particle swarm for a flow shop scheduling problem
- Parallel hybrid heuristics for the permutation flow shop problem
- Application of tabu search to process plan optimization for four-axis CNC turning centres
- A comprehensive review and evaluation of permutation flowshop heuristics
- Evaluating the performance of tabu search procedures for flow shop sequencing
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
- 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
- The evolution of schematic representations of flow shop scheduling problems
- Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime
- Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation
- An adaptive hybrid metaheuristic for permutation flowshop scheduling
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
- Applying tabu search to the job-shop scheduling problem
- Permutation flow shop scheduling with earliness and tardiness penalties
- Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect
- scientific article; zbMATH DE number 30947 (Why is no real title available?)
This page was built for publication: A tabu search approach for the flow shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296693)
