Scheduling with Gaps: New Models and Algorithms

DOI10.1007/978-3-319-18173-8_8zbMath1394.90268arXiv1410.7092OpenAlexW1564611115WikidataQ58062875 ScholiaQ58062875MaRDI QIDQ2947014

Dorian Nogneng, Tak-Wah Lam, Marek Chrobak, Mordecai J. Golin

Publication date: 21 September 2015

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

Full work available at URL: https://arxiv.org/abs/1410.7092

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (3)

Refined algorithms for hitting many intervals ⋮ Scheduling with Gaps: New Models and Algorithms ⋮ Maximizing dominance in the plane and its applications

Cites Work

• Selection in \(X+Y\) and matrices with sorted rows and columns
• Monge strikes again: Optimal placement of web proxies in the internet
• Scheduling to minimize gaps and power consumption
• Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines
• Scheduling with Gaps: New Models and Algorithms
• 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: Scheduling with Gaps: New Models and Algorithms