Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
From MaRDI portal
Publication:1694821
DOI10.1016/j.ejor.2017.06.021zbMath1380.90123OpenAlexW2621871100MaRDI QIDQ1694821
Publication date: 6 February 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.2017.06.021
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (7)
When serial batch scheduling involves parallel batching decisions: a branch and price scheme ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines ⋮ Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ Column generation for minimizing total completion time in a parallel-batching environment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Scheduling a batching machine
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- 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
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Scheduling parallel machines with inclusive processing set restrictions
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- 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
- Improved Algorithms for Bipartite Network Flow
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- Improved bounds for batch scheduling with nonidentical job sizes
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Parallel machine scheduling with job assignment restrictions
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
