Computer Science ›› 2009, Vol. 36 ›› Issue (4): 254-256.
Previous Articles Next Articles
Online:
Published:
Abstract: It was proved by example that the traditional shifting bottleneck cannot obtain a local optimal solutions in solving bottleneck machine, a new model of bottlenecks was presented and it was solved by Filtered beam search-the improving algorithm of branch a
Key words: Job shop scheduling, Shifting bottleneck, Filtered beam search, Scheduling mode
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2009/V36/I4/254
Cited