Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Algabasi, Abdullatif; Maheri, Alireza (2015)
Languages: English
Types: Unknown
Subjects: H100, H300
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] Davis, L. (1985). Job shop scheduling with genetic algorithms. In Proceedings of an International Conference on Genetic Algorithms and Their Applications (Vol. 140). Carnegie-Mellon University Pittsburgh, PA.
    • [2] Carlier, J., & Pinson, É. (1989). An algorithm for solving the job-shop problem. Management science, 35(2), 164- 176.
    • [3] Brucker, P., Jurisch, B., & Sievers, B. (1994). A branch and bound algorithm for the job-shop scheduling problem. Discrete applied mathematics, 49(1), 107-127.
    • [4] Aarts, H., van Laarhoven, J., Lenstra, K., & Ulder, L. (1994). A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing, 6(2), 118-125.
    • [5] Dorndorf, U., & Pesch, E. (1995). Evolution based learning in a job shop scheduling environment. Computers & Operations Research, 22(1), 25-40.
    • [6] Mesghouni, K., Hammadi, S., and Borne, P. (1996). Production job-shop scheduling using genetic algorithms. In Systems, Man, and Cybernetics. IEEE International Conference on (Vol. 2, pp. 1519-1524). IEEE
    • [7] Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management science, 42(6), 797-813.
    • [8] Pinson, E. (1990). A practical use of Jackson's preemptive schedule for solving the job shop problem. Annals of Operations Research, 26(1-4), pp. 269-287.
    • [9] Ying, W. and Bin, L. (1996). 'Job-shop scheduling using genetic algorithm', In Systems, Man, and Cybernetics, IEEE International Conference on, Vol. 3, pp. 1994-1999.
    • [10] Williamson, P., Hall, A., Hoogeveen, A., Hurkens, J., Lenstra, K., Sevast'Janov, V., & Shmoys, B. (1997). Short shop schedules. Operations Research, 45(2), 288-294.
    • [11] Lin, S. C., Goodman, E. D., & Punch III, W. F. (1997). A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem. In ICGA (pp. 481-488).
    • [12] Mesghouni, K., Hammadi, S., & Borne, P. (1998). On modelling genetic algorithms for flexible job-shop scheduling problems. Stud. Inf. Control (Romania), 7(1), 37-47.
    • [13] Vazquez, M., & Whitley, D. (2000). A comparison of genetic algorithms for the static job shop scheduling problem. In Parallel Problem Solving from Nature PPSN VI (pp. 303-312).
    • [14] Garrido, A., Salido, A., Barber, F., & Lopez, A. (2000). Heuristic methods for solving job-shop scheduling problems. In ECAI-2000 Workshop on New Results in Planning, Scheduling and Design, Berlin (pp. 36-43).
    • [15] Gonçalves, F., de Magalhães, J., & Resende, G. (2005). A hybrid genetic algorithm for the job shop scheduling problem. European journal of operational research, 167(1), 77-95.
    • [16] Nowicki, E., & Smutnicki, C. (2005). An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8(2), 145-159.
    • [17] Zhang, Y., Li, P., Rao, Y., & Guan, Z. (2008). A very fast TS/SA algorithm for the job shop scheduling problem. Computers & Operations Research, 35(1), 282-294.
    • [18] Hasan, S. K., Sarker, R., & Cornforth, D. (2008). GA with priority rules for solving job-shop scheduling problems. In Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on (pp. 1913-1920). IEEE.
    • [19] Li, Y., & Chen, Y. (2010). A genetic algorithm for job-shop scheduling. Journal of software, 5(3), 269-274.
    • [20] Hao, X., Lin, L., Gen, M., and Ohno, K. (2013). Effective Estimation of Distribution Algorithm for Stochastic Job Shop Scheduling Problem. Procedia Computer Science, 20, 102-107.
    • [21] Gutierrez, C. (2014). Overlap Algorithms in Flexible Jobshop Scheduling. IJIMAI, 2(6), 41-47.
    • [22] Peng, B., Lu, Z., & Cheng, T. C. E. (2015). A tabu search/path relinking algorithm to solve the job shop scheduling problem. Computers & Operations Research, 53, 154-164.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article