Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
From MaRDI portal
Publication:1772848
DOI10.1016/j.ejor.2004.04.015zbMath1066.90029OpenAlexW1967864040MaRDI QIDQ1772848
Chris N. Potts, Marco Ghirardi
Publication date: 21 April 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.015
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (25)
An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal ⋮ Beam search for the longest common subsequence problem ⋮ A single machine scheduling problem with two-dimensional vector packing constraints ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ Exact makespan minimization of unrelated parallel machines ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling ⋮ A makespan minimization problem for versatile developers in the game industry ⋮ Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration ⋮ Search tree based approaches for parallel machine scheduling ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ A beam search implementation for the irregular shape packing problem ⋮ On solving the assembly line worker assignment and balancing problem via beam search ⋮ Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches ⋮ Iterated greedy local search methods for unrelated parallel machine scheduling ⋮ BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS ⋮ Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
Cites Work
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- Heuristics for scheduling unrelated parallel machines
- An effective heuristic for minimising makespan on unrelated parallel machines
- Algorithms for Scheduling Tasks on Unrelated Processors
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
This page was built for publication: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
