Online scheduling of jobs with kind release times and deadlines on a single machine

DOI10.1007/s11766-019-3512-9zbMath1424.90096OpenAlexW2921007128MaRDI QIDQ2422652

Ran Ma, Qi Feng, Wen-Jie Li

Publication date: 20 June 2019

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-019-3512-9

zbMATH Keywords

schedulingonline algorithmkind release timedeadline

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Online over time scheduling on parallel-batch machines: a survey
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• Online Scheduling with Hard Deadlines
• Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• On-line scheduling on a single machine: Maximizing the number of early jobs
• LPT online strategy for parallel-machine scheduling with kind release times

This page was built for publication: Online scheduling of jobs with kind release times and deadlines on a single machine