Baptiste, P., Peridy, L., & Sourd, F. (2000). Job-shop scheduling. Retrieved March 2, 2007, from www-poleia.lip6.fr/~sourd/jobshop.pdf
Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999). Swarm intelligence: from natural to artificial systems: Oxford University Press.
Bonabeau, E., & Meyer, C. (2001). Swarm intelligence: a whole new way to think about business. Harvard Business Review.
Boyd, S., Ghosh, A., & Magnani, A. (2003). Branch and bound methods. Retrieved July 1, 2006, from www.stanford.edu/class/ee392o/bb.pdf
Chavez, M. A. C., Solis, J. F., & Quintana, F. R. (2004). The problem of using the calculation of the critical path to solve instances of the job shop scheduling problem. Transactions on Engineering, Computing and Technology, 1, 294-297.
Cheeseman, M. (2007). The application of naturally-inspired algorithms to the job-shop scheduling problem. Retrieved March 11, 2007, from www.cs.bham.ac.uk/~xin/courses/projects/globalScheduling.pdf
Chong, C. S., Low, Y. H., Malcolm, Sivakumar, A. I., & Gay, K. L. (2006, December 3-6). A bee colony optimization algorithm to job shop scheduling. Paper presented at the 2006 Winter Simulation Conference, Monterey, CA USA.
Cicirello, V. A., & Smith, S. F. (2001). Insect societies and manufacturing. Retrieved March 17, 2006, from www.agent.ai/doc/upload/200302/smit01.pdf
Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994). Ant system for job-shop scheduling. JORBEL - Belgian J. Oper. Res., Statist Comp. Sci., 34(1), 39-53.
Dominic, P. D. D., Kaliyamoorthy, S., & Kumar, M. S. (2004). Efficient dispatching rules for dynamic job shop scheduling. Int J Adv Manuf Technol, 24, 70-75.
Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, 26(1), 29-41.
Gabarro, K. (2000). Tabu search algorithm. Retrieved July 1, 2006, from http://www.lsi.upc.es/~mallba/public/library/firstProposal-BA/node11.html
Glover, F. (2001). Tabu search. Retrieved March 14, 2007
Gupta, A. K., & Sivakumar, A. I. (2004). Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol, 27, 1163-1169.
Hertz, A., Taillard, E., & de Werra, D. (2003). A tutorial on tabu search. Retrieved July 1, 2006, from http://www.cs.colostate.edu/~whitley/CS640/hertz92tutorial.pdf
Hochbaum, D. S. (1999). The scheduling problem. Retrieved March 7, 2007, from http://riot.ieor.berkeley.edu/~vinhun/index.html
Holthaus, O., & Rajendran, C. (1997a). Efficient dispatching rules for scheduling in a job shop. Int. J. Production Economics, 48, 87-105.
Holthaus, O., & Rajendran, C. (1997b). New dispatching rules for scheduling in a job shop - an experimental study. Int J Adv Manuf Technol, 13, 148-153.
Jain, A. S., & Meeran, S. (1999). Deterministic job-shop scheduling: past, present and future. European Journal of Operational Research, 113(2), 390-434.
Kamath, G., & Hong, K. (2004). The job shop scheduling problem. Retrieved July 24, 2006, from http://web.syr.edu/~gkamathh/presentations/jssp.ppt
Kimball, J. W. (2005). Honeybee communication. Retrieved September 22, 2006, from http://users.rcn.com/jkimball.ma.ultranet/BiologyPages/B/BeeDances.html
Musliu, N., Schaerf, A., & Slany, W. (2004). Local search for shift design. European Journal of Operational Research, 153, 51-64.
Nakrani, S., & Tovey, C. (2003, December 15-17). On honey bees and dynamic allocation in an internet server colony. Paper presented at the 2nd International Workshop on The Mathematics and Algorithms of Social Insects, Atlanta, Georgia, USA.
Petrovic, S. (2007). Job shop scheduling. Retrieved March 15, 2007, from www.cs.nott.ac.uk/~sxp/Scheduling/JobShop.pdf
Petrovic, S., Fayad, C., & Petrovic, D. (2005). Job shop scheduling with lot-sizing and batching in an uncertain real-world environment. Paper presented at the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2005), New York, USA.
Unachak, P. (2007). Genetic algorithm in job shop scheduling. Retrieved December 27, 2006, from http://www.cse.msu.edu/~unachakp/SurveyPresent.ppt
van der Zwaan, S., & Marques, C. (1999). Ant colony optimization for job shop scheduling. Paper presented at the Third Workshop on Genetic Algorithms and Artificial Life (GAAL 99), Lisbon, Portugal.
Von Frisch, K. (1973). Decoding the language of the bee. Nobel Lecture, University of Munich, Federal Republic of Germany Retrieved September 19, 2006, from http://nobelprize.org/nobel_prizes/medicine/laureates/1973/frisch-lecture.pdf
Wilcox, A. (2005). JIP - the Java Interactive Profiler: an effective new configurable profiler for Java. Retrieved August 21, 2006, from jiprof.sourceforge.net
Xu, Q. (2001). Introduction to job shop scheduling problem. Retrieved May 17, 2006, from http://www.cs.umbc.edu/671/fall01/class-notes/jobshop.ppt
Yamada, T. (2003). Studies on metaheuristics for jobshop and flowshop scheduling problems. Kyoto University, Kyoto.
Yin, A.-H. (2004, August 26-29). A new neighbourhood structure for the job shop scheduling problem. Paper presented at the Third International Conference on Machine Learning and Cybernetics, Shanghai.
