Approximation of the parallel machine scheduling problem with additional unit resources

DOI10.1016/j.dam.2016.07.003zbMath1356.90055OpenAlexW2501772509MaRDI QIDQ323055

Nicolas Jozefowiez, Marie-José Huguet, Adrien Maillard, Emmanuel Hebrard, Gérard Verfaillie, Cédric Pralet

Publication date: 7 October 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.07.003

zbMATH Keywords

schedulingapproximationadditional resources

Mathematics Subject Classification ID

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

Related Items (3)

An FPTAS for scheduling with resource constraints ⋮ Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques ⋮ An improved algorithm for parallel machine scheduling under additional resource constraints

Cites Work

• Scheduling with conflicts: Online and offline algorithms
• Scheduling jobs with time-resource tradeoff via nonlinear programming
• Scheduling subject to resource constraints: Classification and complexity
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Scheduling jobs on identical machines with agreement graph
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• `` Strong NP-Completeness Results

This page was built for publication: Approximation of the parallel machine scheduling problem with additional unit resources