The solvable cases of a scheduling algorithm

DOI10.1007/978-3-642-45030-3_22MaRDI QIDQ2872088zbMATH OpenOpenAlexFDO

Authors Sam Walker, Yakov Zinder

Publication date 14 January 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45030-3_22

zbMATH Keywords

identical parallel machinesmaximum latenessprecedence constraintspreemptionsscheduling theorysolvable cases

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• Scheduling UET-UCT outforests to minimize maximum lateness
• About one algorithm for solving scheduling problem
• On a parallel machine scheduling problem with precedence constraints
• Optimal scheduling on parallel machines for a new order class

Cited in

(5)

• The worst-case analysis of the Garey-Johnson algorithm
• scientific article; zbMATH DE number 1731178 (Why is no real title available?)
• scientific article; zbMATH DE number 4031379 (Why is no real title available?)
• scientific article; zbMATH DE number 2166451 (Why is no real title available?)
• About one algorithm for solving scheduling problem

This page was built for publication: The solvable cases of a scheduling algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872088)