Exact makespan minimization of unrelated parallel machines
DOI10.5802/ojmo.4zbMath1497.90080OpenAlexW3161138157MaRDI QIDQ2165594
Domenico Spensieri, Edvin Åblad, Ann-Brith Strömberg
Publication date: 20 August 2022
Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5802/ojmo.4
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
- An exact method with variable fixing for solving the generalized assignment problem
- Approximation algorithms for scheduling unrelated parallel machines
- Iterated greedy local search methods for unrelated parallel machine scheduling
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Unrelated parallel machine scheduling using local search
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Local branching
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Branching rules revisited
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Integer Programming
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Validation of subgradient optimization
- Nonlinear Programming
- Minimization of unsmooth functionals
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Automata, Languages and Programming
- A Machine Learning-Based Approximation of Strong Branching
- Branching on Multi-aggregated Variables
This page was built for publication: Exact makespan minimization of unrelated parallel machines
