1. Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA Journal on Computing (1991) 149–156
2. Baptiste, P., Le Pape, C.: A Constraint-Based Branch and Bound Algorithm for preemptive Job Shop Scheduling Problem. In Proceedings of the International Workshop on Production Planning and Control, Mons, Belgium (1996)
3. Blazewicz, J., Sterna, M., Pesch, E.: A Branch and Bound algorithm for the Job Shop scheduling problem. (A Drexl and A. Kimms, eds.) Beyond Manufacturing Resource Planning (MRP II). Springer Verlap, Berlin (1998) 219–254
4. Carlier, J., Pinson, E.: An algorithm for solving the job shop scheduling problem. Management Science (1989) 164–176
5. Cardon, A., Galinho, T., Vacher, J. P.: A Multi-Objective Genetic Algorithm in Job-Shop Scheduling Problem to Refine an Agents’ Architecture. In Kaisa Miettinen, Marko M. Makela, Pekka Neittaanmaki, and Jacques Periaux, editors, Proceedings of EUROGEN’ 99, Jyvaskyla, Finland (1999)