A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
Authors:
- Zhigang CaoZCZhigang Cao
- Xiaoguang YangXYXiaoguang Yang
- 1 June 2009
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (27-29) , 2732-2745
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (70425004, 90818026)
This publication has 18 references indexed in Scilit:
- Minimizing makespan with release times on identical parallel batching machinesDiscrete Applied Mathematics, 2005
- Minimizing makespan on a single batching machine with release times and non-identical job sizesOperations Research Letters, 2005
- Minimizing Makespan in Batch Machine SchedulingAlgorithmica, 2004
- Preemptive scheduling with rejectionMathematical Programming, 2003
- On-line scheduling of unit time jobs with rejection: minimizing the total completion timeOperations Research Letters, 2002
- Preemptive multiprocessor scheduling with rejectionTheoretical Computer Science, 2001
- Multiprocessor Scheduling with RejectionSIAM Journal on Discrete Mathematics, 2000
- Scheduling with batching: A reviewEuropean Journal of Operational Research, 2000
- Minimizing makespan on a single batch processing machine with dynamic job arrivalsInternational Journal of Production Research, 1999
- Efficient scheduling algorithms for a single batch processing machineOperations Research Letters, 1986