Author:
Zobolas G. I.,Tarantilis C. D.,Ioannou G.
Publisher
Springer Berlin Heidelberg
Reference185 articles.
1. Aarts, E.H.L, Van Laarhooven, P.J.M., Lenstra, J.K., Ulder, N.L.J. (1994) A computational study of local search algorithms for job-shop scheduling. ORSA J Comput 6:118–125
2. Aarts, E.H.L., Van Laarhooven, P.J.M., Ulder, N.L.J. (1991) Local search based algorithms for job-shop scheduling. Working Paper, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
3. Adams, J., Balas, E., Zawack, D. (1988) The shifting bottleneck procedure for the job-shop scheduling. Manage Sci 34:391–401
4. Adiri, I., Aizikowitz, N. (1989) Open shop scheduling problems with dominated machines. Nav Res Logist Q 36:273–281
5. Applegate, D., Cook, W. (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3:149–156
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献