Makespan minimization on unrelated parallel machines with a few bags

DOI10.1007/978-3-030-04618-7_3zbMath1522.90018OpenAlexW2901038528MaRDI QIDQ6049079

Daniel R. Page, Roberto Solis-Oba

Publication date: 16 October 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-04618-7_3

zbMATH Keywords

schedulingunrelated parallel machinesmakespan minimizationapproximation algorithmsbag constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Makespan minimization on unrelated parallel machines with a few bags ⋮ Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations ⋮ Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments

This page was built for publication: Makespan minimization on unrelated parallel machines with a few bags