Computer Science ›› 2009, Vol. 36 ›› Issue (4): 254-256.

Previous Articles     Next Articles

  

  • Online:2018-11-16 Published:2018-11-16

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

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!