Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
From MaRDI portal
Publication:2268765
DOI10.1007/S10878-008-9163-ZzbMath1183.90179OpenAlexW2014763284MaRDI QIDQ2268765
Publication date: 9 March 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9163-z
Related Items (7)
Unbounded parallel-batch scheduling with family jobs and delivery coordination ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Scheduling a bounded parallel-batching machine with incompatible job families and rejection ⋮ Online scheduling on unbounded parallel-batch machines with incompatible job families ⋮ Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness ⋮ Single-machine batch scheduling with job processing time compatibility ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
- Unnamed Item
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Scheduling a batching machine
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- Minimizing makespan with release times on identical parallel batching machines
- On scheduling an unbounded batch machine
- Complexity results for single-machine problems with positive finish-start time-lags
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
