[1] J. Adams, E. Balas, and D. Zawack, The shifting bottleneck procedure for job shop scheduling, "Management Science", 34, 1988, pp. 391-401.

[2] D. Applegate and W. Cook, A computational study of job shop scheduling, "ORSA Journal on Computing", 3, 1991.

[3] E. Balas and A. Vazacopoulos, Guided local search and shitting bottleneck procedure for job shop scheduling, Management Science Research Report MSSR-609, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1994.

[4] E. Balas, G. Lancia, P. Serafini, and A. Vazacopoulos, Job shop scheduling with dead-lines, "Journal of Combinatorial Optimization", 1 , 1998, pp. 329-353.

[5] E. Balas, J.K. Lenstra, and A. Vazacopoulos, The one machine problem with delayed precedence constraints and its use in job shop scheduling, "Management Science", 41, 1995, pp. 94-109.

[6] M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (eds.), Handbook in operations research and management science, vol. 8, Network Routing, Elsevier, 1995.

[7] J.-Y. Blais, J. Lamont, and J-M. Rousseau, The HASTUS vehicle and manpower scheduling system at the Societé de transport de la Communauté urbaine de Montréal, "Interfaces", 20, 1990, pp. 26-42.

[8] J. Carlier, The one-machine sequencing problem, "European Journal of Operational Research", 11, 1982, pp. 42-47.

[9] J. Carlier and E. Pinson, An algorithm for solving the job shop problem, "Management Science", 35, 1989, pp. 164-176.

[10] P. Carraresi, G. Gallo, and J.-M. Rousseau, Relaxation approaches to large-scale bus driver scheduling problems, "Transportation Research B", 16, 1982, pp. 383-397.

[11] E. Demirkol, S. Mehta, and R. Uzsoy, Benchmarking for shop scheduling problems, Research Memorandum No. 96-4, Purdue University, 1996.

[12] H. Fisher and G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in "Industrial Scheduling", J.F. Muth and G.L. Thompson (eds.), Prentice-Hall, Englewood Cliffs, 1963.

[13] B.J. Lageweg, J.K. Lenstra, and A.H.G. Rinnooy Kan, Job-shop scheduling by implicit enumeration, "Management Science", 34 , 1977, pp. 441-450.

[14] V.J. Leon, Personal communication, 1992.

[15] V.J. Leon and S.D. Wu, On scheduling with ready-times, due-dates and vacations, "Naval Research Logistics", 39, 1992, pp. 53-65.

[16] R. Lessard, J.-M. Rousseau, and D. Dupuis, HASTUS I: a mathematical programming approach to the bus crew scheduling problem, in "Computer scheduling of public transit", A. Wren (ed.), North Holland, New York, 1981, pp. 255-267.

[17] J.-M. Rousseau, R. Lessard, and J.Y. Blais, Enhancements to the HASTUS crew scheduling algorithm, in "Computer scheduling of public transit", vol. 2, J.M. Rousseau (ed.), North Holland, New York, 1985, pp. 295-310.