Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem

DOI10.1016/j.cor.2014.08.002zbMath1348.90308OpenAlexW2062583960MaRDI QIDQ337268

António Manuel Dias, José Coelho, Veronique Sels, Mario Vanhoucke

Publication date: 10 November 2016

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

Full work available at URL: http://hdl.handle.net/10400.2/3446

zbMATH Keywords

machine schedulingSAT

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server ⋮ An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes ⋮ Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems ⋮ Quantum annealing to solve the unrelated parallel machine scheduling problem ⋮ Bounds for parallel machine scheduling with predefined parts of jobs and setup time ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics ⋮ An optimal algorithm for global optimization and adaptive covering ⋮ Metric approach for finding approximate solutions of scheduling problems ⋮ Unnamed Item

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Unrelated parallel machine scheduling using local search
• A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• A cutting plane algorithm for the unrelated parallel machine scheduling problem
• Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
• An effective heuristic for minimising makespan on unrelated parallel machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
• Genetic Algorithms
• Scheduling Unrelated Parallel Machines Computational Results
• Handbook of metaheuristics
• Scheduling tasks on unrelated machines: large neighborhood improvement procedures

This page was built for publication: Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem