Publisher
Springer International Publishing
Reference23 articles.
1. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research 41, 157–183 (1993)
2. Bilge, U., Ulusoy, G.: A time window approach to simultaneous scheduling of machines and material handling system in an fms. Operations Research 43, 1058–1070 (1995)
3. Lenstra, J., Rinnooy Kan, A.: Computational complexity of discrete optimization problems. Annals of Discrete Mathematics 4, 281–300 (1979)
4. Gambardella, L., Mastrolilli, M.: Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling 3 (1996)
5. Dauzère-Pérès, S., Paulli, J.: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research 70, 281–306 (1997)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献