1. Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34, 391–401.
2. Aktürk, M. S., & Yildirim, M. B. (1999). A new dominance rule for the total weighted tardiness problem. Production Planning and Control, 10(2), 138–149.
3. Applegate, D., & Cook, W. (1991). A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2), 149–156.
4. Baptiste, P., & Le Pape, C. (1996). Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proceedings of the fifteenth workshop of the UK planning special interest group, Liverpool, United Kingdom.
5. Beck, J. C. (1999). Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling. Ph.D. dissertation, University of Toronto, Toronto, Canada.