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.044zbMATH Open1402.90056OpenAlexW2557854731MaRDI QIDQ1753395FDOQ1753395
Authors: Shu-Guang Li 
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
Recommendations
- Parallel batch scheduling with nested processing set restrictions
- Minimizing makespan with release times on identical parallel batching machines
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Scheduling parallel machines with inclusive processing set restrictions and job release times
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Scheduling with batching: A review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a batching machine
- Scheduling one batch processor subject to job release dates
- Algorithms for Scheduling Independent Tasks
- Title not available (Why is that?)
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Title not available (Why is that?)
- Scheduling unit-length jobs with machine eligibility restrictions
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation algorithms in batch processing
- Scheduling algorithms
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling Groups of Jobs on a Single Machine
- The complexity of one-machine batching problems
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Scheduling for parallel processing
- On-line load balancing in a hierarchical server topology
- Parallel machine scheduling with job assignment restrictions
- Parallel machine scheduling under a grade of service provision
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Fast approximation algorithms for job scheduling with processing set restrictions
- Task Scheduling on a Multiprocessor System with Independent Memories
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- Minimizing makespan with release times on identical parallel batching machines
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
- Complexity of scheduling problems with multi-purpose machines
- A PTAS for semiconductor burn-in scheduling
- Bounds on the Scheduling of Typed Task Systems
- Analysis of scheduling problems with typed task systems
- On-line load balancing of temporary tasks revisited
Cited In (8)
- Parallel-machine scheduling in shared manufacturing
- Title not available (Why is that?)
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Parallel batch scheduling with nested processing set restrictions
- Parallel machine scheduling with nested processing set restrictions and job delivery times
- Minimizing makespan with release times on identical parallel batching machines
- Approximation algorithms for batch scheduling with processing set restrictions
This page was built for publication: Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753395)
