DocumentCode
436237
Title
Task scheduling in manufacturing systems based on an efficient branch and bound algorithm
Author
Jalilvand, Abolfazl ; Khanmohammadi, Sohrab
Author_Institution
Fac. of Electr. Eng., Tabriz Univ., Iran
Volume
1
fYear
2004
fDate
1-3 Dec. 2004
Firstpage
271
Abstract
The branch and bound (BB) algorithm is one of the common used methods in solving the task scheduling problems in manufacturing systems. In this paper, we introduced a new method to apply the branch and bound algorithm with a reduced memory size. By this method the running time decreases considerably. The algorithm is applied to a combinational discrete job shop scheduling system, where a Petri net is used for modeling.
Keywords
Petri nets; discrete event systems; job shop scheduling; tree searching; Petri nets; branch and bound algorithm; combinational discrete job shop scheduling system; manufacturing systems; task scheduling problem; Costs; Discrete event systems; Electrical engineering; Job shop scheduling; Manufacturing systems; Production; Scheduling algorithm; Terminology; Tree data structures; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics, Automation and Mechatronics, 2004 IEEE Conference on
Print_ISBN
0-7803-8645-0
Type
conf
DOI
10.1109/RAMECH.2004.1438929
Filename
1438929
Link To Document