The solvable cases of a scheduling algorithm

DOI10.1007/978-3-642-45030-3_22zbMATH Open1407.90177OpenAlexW315885957MaRDI QIDQ2872088FDOQ2872088

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

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

zbMATH Keywords

maximum latenessprecedence constraintsidentical parallel machinesscheduling theorypreemptionssolvable cases

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (5)

• Title not available (Why is that?)
• About one algorithm for solving scheduling problem
• The worst-case analysis of the Garey-Johnson algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)

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)