By Topic

Minimizing Makespan on an Unbounded Parallel Batch Processor with Rejection and Release Times

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Haodi Feng ; Sch. of Comput. Sci. & Technol., Shandong Univ., Jinan, China ; Hong Liu

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.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:2 )

Date of Conference:

March 31 2009-April 2 2009