By Topic

Scheduling of sequence-dependant jobs on parallel multiprocessor systems using a branch and bound-based Petri net

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)
Jalilvand, A. ; Dept. of Electr. Eng., Zanjan Univ. ; Khanmohammadi, S. ; Shabaninia, F.

This paper presents a new branch-and-bound algorithm for minimizing the make-span of a job-shop scheduling problem where n jobs must be scheduled on m machines. It is assumed that the jobs are available at time zero and have sequence-dependent setup times on machines. For solving the scheduling problem we develop a new branch and bound system which constructs its search tree gradually and does not need a large size memory. An upper-bound cost (UBC) is introduced to initialize the root node in search tree which reduces Branch and Bound computations. For modeling the manufacturing system and applying the desired sequence-dependent schedule on it, a supervisor Petri net is introduced. The proposed methods are verified through a computational experiment

Published in:

Emerging Technologies, 2005. Proceedings of the IEEE Symposium on

Date of Conference:

18-18 Sept. 2005