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

A new efficient priority rule for scheduling job on identical parallel machines

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)
Sahraoui, N. ; Polytech. Mil. Sch., Algiers, Algeria ; Hentous, H.

This article aims to study the problem of scheduling on identical parallel machines with different release dates and precedence constraints in tree form to minimize the number of the late jobs; this particular criterion is often used like a performance indicator. This problem is noted by Pm| ri, outtree|ΣUi in standard classification (Graham and Al, 1979). Initially, we present an outline of the work completed by the problems of scheduling to minimize the number of the late jobs. Thereafter we propose two heuristics to solve this problem, the first heuristic based on a new priority rule and the second based on EDD rule.

Published in:

Machine and Web Intelligence (ICMWI), 2010 International Conference on

Date of Conference:

3-5 Oct. 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.