Effective iterative algorithms in scheduling theory

DOI10.1007/BF01075122MaRDI QIDQ3714886zbMATH OpenOpenAlexFDO

Authors Ya. A. Zinder, V. V. Shkurba

Publication date 1985

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01075122

zbMATH Keywords

deterministic schedulingdue datesfeasible schedulefinish timespolynomial bounded algorithmprecedence relation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An iterative algorithm for scheduling UET tasks with due dates and release times.
• Min-sum scheduling under precedence constraints
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• scientific article; zbMATH DE number 3883931

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Two-Processor Scheduling with Start-Times and Deadlines

Cited in

(5)

• An iterative algorithm for scheduling UET tasks with due dates and release times.
• Scheduling the two-way traffic on a single-track railway with a siding
• Efficient algorithms for periodic scheduling
• Scheduling in a contaminated area: a model and polynomial algorithms
• scientific article; zbMATH DE number 4055024 (Why is no real title available?)

This page was built for publication: Effective iterative algorithms in scheduling theory

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