MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
From MaRDI portal
Publication:3421855
DOI10.1142/S0129054106004509zbMath1169.68349OpenAlexW2027044567MaRDI QIDQ3421855
Xingqin Qi, Guo Jun Li, Shuguang Li
Publication date: 8 February 2007
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054106004509
approximation algorithmstotal weighted completion timebatch schedulingpolynomial time approximation scheme
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm ⋮ Batch scheduling of nonidentical job sizes with minsum criteria ⋮ A best online algorithm for scheduling on two parallel batch machines
Cites Work
- Unnamed Item
- Scheduling a batching machine
- On-line scheduling a batch processing system to minimize total weighted job completion time
- A PTAS for semiconductor burn-in scheduling
- Minimizing makespan with release times on identical parallel batching machines
- Scheduling with batching: A review
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime