Cart (Loading....) | Create Account
Close category search window
 

Parallel-batching scheduling problem with family jobs for minimizing makespan

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

3 Author(s)
Meng Jintao ; Zhengzhou Inst. of Aeronaut. Ind. Manage., Zhengzhou, China ; Yu Jun ; Lu Xiaoxu

In this paper we consider the problem of scheduling family jobs on a parallel-batching machine under on-line setting, Our objective is to minimize the maximum completion time of the jobs (makespan). A batch processing machine can handle up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. The jobs from different families are incompatible and thus cannot be put in the same batch. We construct our schedule irrevocably as time proceeds and do not know of the existence of any job until its arrival. We deal with the special variant of the problem: the bounded model in which the capacity of the machine is limited, the jobs only have two distinct arrival times and the jobs come from m families. We provide an on-line algorithm with a worst case ratio of 2 - α/2, where α = (√5-1)/2.

Published in:

Industrial and Information Systems (IIS), 2010 2nd International Conference on  (Volume:1 )

Date of Conference:

10-11 July 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.