An O(n^3)-time algorithm for the min-gap unit-length job scheduling problem

DOI10.1007/978-3-031-22105-7_42OpenAlexW4313343285MaRDI QIDQ6168970FDOQ6168970

Authors: Fei Li 

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22105-7_42

zbMATH Keywords

dynamic programmingscheduling algorithmsamortized analysis

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Polynomial-time algorithms for minimum energy scheduling
• Scheduling unit tasks to minimize the number of idle periods
• A greedy approximation algorithm for minimum-gap scheduling

This page was built for publication: An \(O(n^3)\)-time algorithm for the min-gap unit-length job scheduling problem

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