Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
From MaRDI portal
Publication:632642
DOI10.1016/j.cor.2010.10.012zbMath1208.90068OpenAlexW2124168851MaRDI QIDQ632642
Sven O. Krumke, Stephan Westphal, Alfred Taudes
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.012
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (3)
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time ⋮ Coordinating multi-location production and customer delivery ⋮ Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Revenue Management: Research Overview and Prospects
- Online Scheduling of Equal-Length Jobs on Parallel Machines
- Online Scheduling with Hard Deadlines
- Online Job Admission
- Automata, Languages and Programming
This page was built for publication: Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines