A greedy approximation algorithm for minimum-gap scheduling

DOI10.1007/978-3-642-38233-8_9MaRDI QIDQ4924641zbMATH OpenOpenAlexFDO

Authors Sanjeev Khanna, Fei Li, Joseph (Seffi) Naor, Marek Chrobak, Mohammad T. Hajiaghayi, Uriel Feige

Publication date 7 June 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-38233-8_9

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• A greedy approximation algorithm for minimum-gap scheduling
• Scheduling with gaps: new models and algorithms
• Scheduling with gaps: new models and algorithms
• Scheduling with a minimum number of machines
• Scheduling to minimize gaps and power consumption

Cited in

(6)

• Scheduling with gaps: new models and algorithms
• Scheduling to minimize gaps and power consumption
• The triangle scheduling problem
• Scheduling with gaps: new models and algorithms
• A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay
• A greedy approximation algorithm for minimum-gap scheduling

This page was built for publication: A greedy approximation algorithm for minimum-gap scheduling

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