Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
From MaRDI portal
Publication:1753395
DOI10.1016/j.ejor.2016.11.044zbMath1402.90056OpenAlexW2557854731MaRDI QIDQ1753395
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.2016.11.044
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Parallel batch scheduling with nested processing set restrictions, Approximation algorithms for batch scheduling with processing set restrictions, Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities, Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines, Parallel-machine scheduling in shared manufacturing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast approximation algorithms for job scheduling with processing set restrictions
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Approximation algorithms for scheduling unrelated parallel machines
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Scheduling for parallel processing
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Scheduling a batching machine
- The complexity of one-machine batching problems
- Analysis of scheduling problems with typed task systems
- Complexity of scheduling problems with multi-purpose machines
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- A PTAS for semiconductor burn-in scheduling
- Minimizing makespan with release times on identical parallel batching machines
- Parallel machine scheduling under a grade of service provision
- Scheduling with batching: A review
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Scheduling unit-length jobs with machine eligibility restrictions
- On-Line Load Balancing in a Hierarchical Server Topology
- Scheduling parallel machines with inclusive processing set restrictions
- Bounds on the Scheduling of Typed Task Systems
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Algorithms for Scheduling Independent Tasks
- Task Scheduling on a Multiprocessor System with Independent Memories
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
- Scheduling Groups of Jobs on a Single Machine
- Parallel machine scheduling with job assignment restrictions
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- On-line load balancing of temporary tasks revisited
