By Topic

Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck

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 $31
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)
Yan, Zuo ; Inst. of Automation, Shanghai Jiaotong Univ., Shanghai 200240, P. R. China ; Hanyu, Gu ; Yugeng, Xi

A modified bottleneck-based (MB) heuristic for large-scale job-shop scheduling problems with a well-defined bottleneck is suggested, which is simpler but more tailored than the shifting bottleneck (SB) procedure. In this algorithm, the bottleneck is first scheduled optimally while the non-bottleneck machines are subordinated around the solutions of the bottleneck schedule by some effective dispatching rules. Computational results indicate that the MB heuristic can achieve a better tradeoff between solution quality and computational time compared to SB procedure for medium-size problems. Furthermore, it can obtain a good solution in a short time for large-scale job-shop scheduling problems.

Published in:

Systems Engineering and Electronics, Journal of  (Volume:18 ,  Issue: 3 )