This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Minimizing Makespan on an Unbounded Parallel Batch Processor with Rejection and Release Times
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
In this paper, we consider the following scheduling model:Jobs can either be scheduled on an unbounded parallel batch processor or be rejected. Jobs arrive at different times. The scheduled jobs will be processed together as a batch the processing time of which is the greatest processing time of its members. For each rejected job, there is a corresponding penalty cost. The objective is to minimize the sum of the makespan of the scheduled jobs and the total penalties of the rejected ones. We show that the problem is polynomial time solvable when the number of release times is fixed, and present a PTAS for the general case.
Index Terms:
parallel batch scheduling, rejection, algorithm, PTAS
Citation:
Haodi Feng, Hong Liu, "Minimizing Makespan on an Unbounded Parallel Batch Processor with Rejection and Release Times," csie, vol. 2, pp.587-590, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.