A dynamic programming framework for non-preemptive scheduling problems on multiple machines
DOI10.1137/1.9781611973730.72zbMATH Open1371.90056OpenAlexW4234810097MaRDI QIDQ5363000FDOQ5363000
Authors: Sungjin Im, Shi Li, Benjamin Moseley, 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
Recommendations
- Approximating the optimal algorithm for online scheduling problems via dynamic programming
- Dual techniques for scheduling on a machine with varying speed
- Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
- Scheduling jobs that arrive over time
- On minimizing the total flow time on multiple machines
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation algorithms (68W25)
Cited In (6)
- From Preemptive to Non-preemptive Scheduling Using Rejections
- Maximizing Throughput in Flow Shop Real-Time Scheduling
- Approximations for Throughput Maximization
- An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization
- Title not available (Why is that?)
- Minimizing the maximum flow time in the online food delivery problem
This page was built for publication: A dynamic programming framework for non-preemptive scheduling problems on multiple machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363000)
