Author:
Danna Emilie,Pape Claude Le
Reference63 articles.
1. Aboudi, R. and Jörnsten, K. (1994). Tabu search for general zero-one integer programs using the pivot and complement heuristic. ORSA Journal on Computing, 6(1):82–93.
2. Adams, J., Balas, E., and Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34(3):391–401.
3. Applegate, D. and Cook, W. (1991). A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2): 149–156.
4. Balas, E. and Martin, C. (1980). Pivot and complement — a heuristic for 0–1 programming. Management Science, 26(1):224–234.
5. Baptiste, P. and Le Pape, C. (1995). A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献