Scheduling parallel machines with inclusive processing set restrictions and job release times
From MaRDI portal
Publication:1044087
DOI10.1016/j.ejor.2009.02.011zbMath1177.90170OpenAlexW2111788137MaRDI QIDQ1044087
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/1834
Related Items (16)
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions ⋮ Parallel machine scheduling with nested processing set restrictions ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Fast approximation algorithms for job scheduling with processing set restrictions ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Scheduling uniform machines with restricted assignment ⋮ A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions ⋮ The ``least flexible job first rule in scheduling and in queueing ⋮ Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates ⋮ Improved approximation algorithms for parallel machine scheduling with release dates and job rejection ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Fast approximation algorithms for uniform machine scheduling with processing set restrictions ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ Scheduling jobs with release and delivery times subject to nested eligibility constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Online and semi-online scheduling of two machines under a grade of service provision
- Grouping techniques for scheduling problems: simpler and faster
- Online scheduling on parallel machines with two goS levels
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Parallel machine scheduling under a grade of service provision
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Approximation Techniques for Average Completion Time Scheduling
- On-Line Load Balancing in a Hierarchical Server Topology
- SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
- Integer Programming with a Fixed Number of Variables
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
- Scheduling parallel machines with inclusive processing set restrictions
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Task Scheduling on a Multiprocessor System with Independent Memories
- Scheduling Unrelated Machines by Randomized Rounding
- Parallel machine scheduling with job assignment restrictions
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
This page was built for publication: Scheduling parallel machines with inclusive processing set restrictions and job release times
