Fast approximation algorithms for uniform machine scheduling with processing set restrictions

DOI10.1016/j.ejor.2017.01.013zbMath1403.90342OpenAlexW2568573404MaRDI QIDQ1753462

Xianqiang Yang

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.013

zbMATH Keywords

schedulingmakespanuniform machinesinclusive processing settree-hierarchical processing setworst-case bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm ⋮ Approximation algorithms for batch scheduling with processing set restrictions ⋮ Scheduling uniform machines with restricted assignment ⋮ Parallel-machine scheduling in shared manufacturing

Cites Work

• Fast approximation algorithms for job scheduling with processing set restrictions
• A note on hierarchical scheduling on two uniform machines
• Online hierarchical scheduling: an approach using mathematical programming
• Scheduling jobs with equal processing times subject to machine eligibility constraints
• Improved bounds for online scheduling with eligibility constraints
• Approximation algorithms for scheduling unrelated parallel machines
• A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
• Online parallel machines scheduling with two hierarchies
• Online scheduling on two uniform machines subject to eligibility constraints
• Online scheduling on two uniform machines to minimize the makespan
• Scheduling parallel machines with inclusive processing set restrictions and job release times
• Online scheduling on uniform machines with two hierarchies
• Online scheduling with equal processing times and machine eligibility constraints
• An optimal rounding gives a better approximation for scheduling unrelated machines
• On-Line Load Balancing in a Hierarchical Server Topology
• Scheduling parallel machines with inclusive processing set restrictions
• Makespan minimization in online scheduling with machine eligibility

This page was built for publication: Fast approximation algorithms for uniform machine scheduling with processing set restrictions