Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
From MaRDI portal
Publication:337268
DOI10.1016/J.COR.2014.08.002zbMATH Open1348.90308OpenAlexW2062583960MaRDI QIDQ337268FDOQ337268
Authors: Veronique Sels, José Coelho, António Manuel Dias, 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
Recommendations
- A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
- A robust optimization approach for the unrelated parallel machine scheduling problem
- Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- 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
- A tabu search algorithm for parallel machine total tardiness problem
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem
- A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- Handbook of metaheuristics
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- 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
- 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
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- Genetic Algorithms
- Scheduling Unrelated Parallel Machines Computational Results
- Scheduling tasks on unrelated machines: large neighborhood improvement procedures
- Iterated greedy local search methods for unrelated parallel machine scheduling
Cited In (13)
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
- An effective heuristic for minimising makespan on unrelated parallel machines
- Title not available (Why is that?)
- 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 optimal algorithm for global optimization and adaptive covering
- A metric approach for scheduling problems with minimizing the maximum penalty
- Metric approach for finding approximate solutions of scheduling problems
- A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
- Unrelated parallel machine scheduling using local search
- 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
- Quantum annealing to solve the unrelated parallel machine scheduling problem
- Bounds for parallel machine scheduling with predefined parts of jobs and setup time
- Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems
Uses Software
This page was built for publication: Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337268)
