By Topic

Global Estimations for Multiprocessor Job-Shop

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

1 Author(s)
Vakhania, M. ; Member, IEEE, Science Faculty, State University of Morelos, Av, Universidad 1001, Cuernavaca 62210, Morelos, Mexico; fax: +52 777 329 70 40; e-mail: nodari@uacm.mx

Classical job-shop scheduling problem (JSP) is one of the heaviest (strongly) NP-hard scheduling problems, which is very difficult to solve in practice. No approximation algorithms with a guaranteed performance exist. We deal with a natural generalization of this problem allowing parallel processors instead of each single processor in JSP, and an arbitrary task graph (without cycles) instead of a serial-parallel task graph in JSP. Parallel processors might be identical, uniform or unrelated. The whole feasible solution space grows drastically compared to JSP. However, as it turned out, parallel processors can also be used to reduce the solution space to a subspace, which is essentially smaller than even the corresponding solution space for JSP. For large problem instances, this space still may remain too big. Here we propose different global estimations which allow us to reduce it further. By applying our bounds to the reduced solution space, a class of exact and approximation algorithms are obtained. We are in the process of the implementation of our reduction algorithm and the bounds. Then we aim to carry out the experimental study comparing the behavior and the efficiency of the proposed bounds in practice

Published in:

Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on

Date of Conference:

1-5 April 2007