Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines
From MaRDI portal
Publication:2931174
DOI10.1142/S0217595914500389zbMath1299.90155OpenAlexW2156227779WikidataQ57185607 ScholiaQ57185607MaRDI QIDQ2931174
Feifeng Zheng, Ming Liu, Zhanguo Zhu, Chengbin Chu
Publication date: 24 November 2014
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595914500389
Cites Work
- Unnamed Item
- On-line scheduling on a batch machine to minimize makespan with limited restarts
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- A best online algorithm for scheduling on two parallel batch machines
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Approximation algorithms in batch processing
- On-line scheduling algorithms for a batch machine with finite capacity
- On-line algorithms for minimizing makespan on batch processing machines