Improving the Efficiency of Tabu Search for Machine Sequencing Problems
From MaRDI portal
Publication:5289348
Cited in
(24)- Common due-date determination and sequencing using tabu search
- Case-based reasoning and improved adaptive search for project scheduling
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Using tabu search to solve the common due date early/tardy machine scheduling problem
- A comparison of local search methods for flow shop scheduling
- Multiple machine JIT scheduling: a tabu search approach
- Performance enhancements to tabu search for the early/tardy scheduling problem
- Flowshop-scheduling problems with makespan criterion: a review
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- Hybrid Genetic Algorithm and Invasive Weed Optimization via Priority Based Encoding for Location-Allocation Decisions in a Three-Stage Supply Chain
- A comprehensive review and evaluation of permutation flowshop heuristics
- Unrelated parallel machine scheduling using local search
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
- Metaheuristics: A bibliography
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- Heuristics for the flow line problem with setup costs
- Genetic algorithms and tabu search: Hybrids for optimization
- Heuristics for permutation flow shop scheduling with batch setup times
This page was built for publication: Improving the Efficiency of Tabu Search for Machine Sequencing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289348)
