A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]

DOI10.1137/1.9781611973730.72zbMath1371.90056OpenAlexW4234810097MaRDI QIDQ5363000

Shi Li, Benjamin Moseley, Sungjin Im, Eric Torng

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973730.72

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items (5)

An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ Unnamed Item ⋮ Maximizing Throughput in Flow Shop Real-Time Scheduling ⋮ From Preemptive to Non-preemptive Scheduling Using Rejections

This page was built for publication: A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]