Level scheduling to minimize schedule length on lots of unit-time jobs

DOI10.1016/0377-2217(91)90097-FzbMath0726.90031OpenAlexW2034035806MaRDI QIDQ803029

Michael B. Richey

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90097-f

zbMATH Keywords

parallel machinespolynomial-time algorithmlevel scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length
• Linear-Time Algorithms for Scheduling on Parallel Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Level scheduling to minimize schedule length on lots of unit-time jobs