A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions

DOI10.1016/J.DISOPT.2009.02.002zbMath1167.90513OpenAlexW2027808249MaRDI QIDQ834188

Yumei Huo, Joseph Y.-T. Leung, Xin Wang

Publication date: 19 August 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2009.02.002

zbMATH Keywords

makespan minimizationpreemptive schedulingrelease timepolynomial-time algorithmsinclusive processing set

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

The ``least flexible job first rule in scheduling and in queueing ⋮ Fast approximation algorithms for uniform machine scheduling with processing set restrictions ⋮ Improved bounds for online scheduling with eligibility constraints

Cites Work

• Scheduling parallel machines with inclusive processing set restrictions and job release times
• Complexity of scheduling problems with multi-purpose machines
• Parallel machine scheduling under a grade of service provision
• Scheduling with Deadlines and Loss Functions
• Scheduling parallel machines with inclusive processing set restrictions
• A new approach to the maximum-flow problem
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Parallel machine scheduling with job assignment restrictions

This page was built for publication: A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions