On-line single machine scheduling with release dates and submodular rejection penalties

DOI10.1007/978-3-031-16081-3_6zbMath1526.90017OpenAlexW4296167530MaRDI QIDQ6167007

Xiaofei Liu, Yaoyu Zhu, Lei Ma, Weidong Li

Publication date: 7 July 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-16081-3_6

zbMATH Keywords

competitive ratioon-line algorithmon-line schedulingsubmodular penalties

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Cites Work

• Penalty cost constrained identical parallel machine scheduling problem
• Single machine scheduling with release dates and rejection
• A push-relabel framework for submodular function minimization and applications to parametric optimization
• Approximation algorithms for precedence-constrained identical machine scheduling with rejection
• Vector scheduling with rejection on a single machine
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Approximation algorithms for the multiprocessor scheduling with submodular penalties
• An improved heuristic for parallel machine scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Vector scheduling with rejection on two machines
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: On-line single machine scheduling with release dates and submodular rejection penalties