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

DOI10.1016/0377-2217(91)90097-FMaRDI QIDQ803029zbMATH OpenOpenAlexFDO

Authors 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

polynomial-time algorithmparallel machineslevel scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length
• Minimizing the number of machines for minimum length schedules
• Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• Optimal level schedules for mixed-model, multi-level just-in-time assembly systems

Cites work

• scientific article; zbMATH DE number 3473339 (Why is no real title available?)
• scientific article; zbMATH DE number 3497365 (Why is no real title available?)
• Linear-Time Algorithms for Scheduling on Parallel Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length

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

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