On a parallel machine scheduling problem with precedence constraints

DOI10.1007/s10951-006-8499-4zbMath1154.90400OpenAlexW2065962833MaRDI QIDQ880562

Isto Aho, Erkki Maekinen

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-8499-4

zbMATH Keywords

AlgorithmsSchedulingPrecedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions ⋮ Some complexity results and an efficient algorithm for quay crane scheduling problem ⋮ Scheduling unit-length jobs with precedence constraints of small height

Cites Work

• Scheduling with Deadlines and Loss Functions
• Complexity of Scheduling under Precedence Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a parallel machine scheduling problem with precedence constraints