Parallel machine scheduling with nested job assignment restrictions

DOI10.1016/j.orl.2009.09.010zbMath1182.90048OpenAlexW2033230185MaRDI QIDQ2270323

Ulrich M. Schwarz, Gerhard J. Woeginger, Muratore, Gabriella

Publication date: 18 March 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.09.010

zbMATH Keywords

schedulingapproximation algorithmsrestricted assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (17)

On some special cases of the restricted assignment problem ⋮ Multiple subset sum with inclusive assignment set restrictions ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Fast approximation algorithms for job scheduling with processing set restrictions ⋮ Structural parameters for scheduling with assignment restrictions ⋮ Restricted assignment scheduling with resource constraints ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online scheduling with equal processing times and machine eligibility constraints ⋮ An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ Scheduling jobs with release and delivery times subject to nested eligibility constraints ⋮ Parallel machine scheduling with nested processing set restrictions and job delivery times ⋮ Algorithms for hierarchical and semi-partitioned parallel scheduling ⋮ Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation schemes for scheduling on parallel machines
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Parallel machine scheduling under a grade of service provision
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Scheduling parallel machines with inclusive processing set restrictions
• Parallel machine scheduling with job assignment restrictions

This page was built for publication: Parallel machine scheduling with nested job assignment restrictions