A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
From MaRDI portal
Publication:1885958
DOI10.1016/S0305-0548(03)00145-XzbMath1068.68143MaRDI QIDQ1885958
Mieczyslaw Wodecki, Jozef Grabowski
Publication date: 12 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A multiperiod single processor scheduling problem with periodic requirements, An effective differential evolution algorithm for permutation flow shop scheduling problem, A real-time order acceptance and scheduling approach for permutation flow shop problems, Some local search algorithms for no-wait flow-shop problem with makespan criterion, On the theoretical properties of swap multimoves, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, A discrete inter-species cuckoo search for flowshop scheduling problems, Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops, Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search, Solving permutation flow shop scheduling problem with sequence-independent setup time, Considering scheduling and preventive maintenance in the flowshop sequencing problem, Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect, Unnamed Item, Minimizing makespan on an \(m\)-machine re-entrant flowshop, A proposal for a hybrid meta-strategy for combinatorial optimization problems, Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem, A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, No-wait job shop scheduling: tabu search and complexity of subproblems, An improved NEH heuristic to minimize makespan in permutation flow shops, Cooperative metaheuristics for the permutation flowshop scheduling problem, Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, An improved particle swarm optimization algorithm for flowshop scheduling problem, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers, Fast heuristics for minimizing the makespan in non-permutation flow shops, Supercomputer Scheduling with Combined Evolutionary Techniques, Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling, Similarities between meta-heuristics algorithms and the science of life, Flowshop-scheduling problems with makespan criterion: a review, A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, An empirical analysis of the optimality rate of flow shop heuristics, Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints, The distributed permutation flowshop scheduling problem, Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
Cites Work
- Unnamed Item
- Unnamed Item
- On the heuristic solution of the permutation flow shop problem by path algorithms
- 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 block approach for single-machine scheduling with release dates and due dates
- A new heuristic method for the flow shop sequencing problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- On two-machine scheduling with release and due dates to minimize maximum lateness
- A fast tabu search algorithm for the permutation flow-shop problem
- Benchmarks for basic scheduling problems
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Tabu Search—Part I
- Tabu Search—Part II
- New block properties for the permutation flow shop problem with application in tabu search
