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

The single-machine parallel-batching scheduling problem with family jobs to minimize 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

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

In this paper we consider the single-machine parallel-batching scheduling problem with family jobs under on-line setting in the sense that we construct our schedule irrevocably as time proceeds and do not know of the existence of any job until its arrival. Our objective is to minimize the maximum completion time of the jobs (makespan). We deal with the special variant of the problem: the unbounded model in which the machine can handle infinite number of jobs simultaneously,the jobs only have two distinct arrival times and come from m families. we provide an on-line algorithm with a worst case ratio of 2 - α/2, where α = √(5 - 1)/2.

Published in:

Communication Systems, Networks and Applications (ICCSNA), 2010 Second International Conference on  (Volume:1 )

Date of Conference:

June 29 2010-July 1 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.