Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments

DOI10.1007/978-3-030-04651-4_23zbMath1436.90054OpenAlexW2900930400MaRDI QIDQ5919646

Marten Maack, Daniel R. Page, Roberto Solis-Oba

Publication date: 11 October 2019

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_23

zbMATH Keywords

unrelated parallel machinesmakespan minimizationapproximation algorithmsrestricted assignmentbounded job assignmentsjob-intersection graphs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

Structural parameters for scheduling with assignment restrictions ⋮ 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 simple job-intersection structure and bounded job assignments