Parallel machine scheduling with nested processing set restrictions
From MaRDI portal
Publication:2655610
DOI10.1016/j.ejor.2009.10.025zbMath1178.90095OpenAlexW2082631305MaRDI QIDQ2655610
Publication date: 25 January 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.10.025
approximation algorithmmakespanNP-hardnonpreemptive schedulingworst-case boundnested processing set restrictions
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (15)
Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Fast approximation algorithms for job scheduling with processing set restrictions ⋮ Scheduling jobs with equal processing times subject to machine eligibility constraints ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs ⋮ 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 ⋮ Parallel-machine scheduling in shared manufacturing
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique.
- Parallel machine scheduling under a grade of service provision
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Scheduling unit-length jobs with machine eligibility restrictions
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- Scheduling parallel machines with inclusive processing set restrictions
- Task Scheduling on a Multiprocessor System with Independent Memories
- An Application of Bin-Packing to Multiprocessor Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with job assignment restrictions
- Semi-matchings for bipartite graphs and load balancing
This page was built for publication: Parallel machine scheduling with nested processing set restrictions