Applying tabu search with influential diversification to multiprocessor scheduling

DOI10.1016/0305-0548(94)90017-5zbMath0814.90048OpenAlexW2091141190MaRDI QIDQ1342105

Fred Glover, Roland Hübscher

Publication date: 12 June 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90017-5

zbMATH Keywords

simulated annealingtabu searchmakespanequivalent processorsmultiple bin packing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem, A study of diversification strategies for the quadratic assignment problem, List scheduling algorithms to minimize the makespan on identical parallel machines, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Metaheuristics: A bibliography, Partial solutions and multifit algorithm for multiprocessor scheduling, A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts, A tabu search algorithm for structural software testing, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria, A composite algorithm for multiprocessor scheduling, A tabu search algorithm for parallel machine total tardiness problem, Minimizing labor requirements in a periodic vehicle loading problem, Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List, Scheduling using tabu search methods with intensification and diversification, Bin packing problem with conflicts and item fragmentation, The job shop scheduling problem: Conventional and new solution techniques, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups, Tight bounds for the identical parallel machine scheduling problem, Machine scheduling models in environmentally focused chemical manufacturing, Performance enhancements to tabu search for the early/tardy scheduling problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tabu search techniques. A tutorial and an application to neural networks
• Euclidean matching problems and the metropolis algorithm
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Tabu Search Applied to the Quadratic Assignment Problem