A PTAS for Minimizing Total Completion Time of Batch Scheduling under Tree Precedence Constraints

2009 ◽  
Author(s):  
Ma Ran ◽  
Han Xuefeng
Keyword(s):  
Completion Time ◽  
Precedence Constraints ◽  
Batch Scheduling ◽  
Total Completion Time

A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING

2002 ◽  
Vol 13 (06) ◽  
pp. 817-827 ◽  
Author(s):  
XIAOTIE DENG ◽  
HAODI FENG ◽  
GUOJUN LI ◽  
GUIZHEN LIU
Keyword(s):  
Completion Time ◽  
Processing Time ◽  
Approximation Scheme ◽  
Processing System ◽  
Handling Time ◽  
Batch Scheduling ◽  
Total Completion Time ◽  
Polynomial Time Approximation Scheme ◽  
Time Approximation ◽  
System P

We consider a batch processing system {pi : i = 1, 2,…,n} where pi is the processing time of job i, and up to B jobs can be processed together such that the handling time of a batch is the longest processing time among jobs in the batch. The number of job types m is not fixed and all the jobs are released at the same time. Jobs are executed non-preemptively. Our objective is to assign jobs to batches and sequence the batches so as to minimize the total completion time. The best previously known result is a 2–approximation algorithm. In this paper, we establish the first polynomial time approximation scheme (PTAS) for the problem.

Sign in / Sign up

Export Citation Format

Share Document