1 |
Bean, J. C. (1994), Genetic algorithms and random keys for sequencing and optimization, INFORMS Journal on Computing, 6(2), 154-160.
DOI
ScienceOn
|
2 |
Bierwirth, C. (1995), A generalized permutation approach to job shop scheduling with genetic algorithms, Operations-Research-Spektrum, 17(2/3), 87-92.
DOI
|
3 |
Cheng, R., Gen, M., and Tsujimura, Y. (1996), A tutorial survey of job-shop scheduling problems using genetic algorithms: I. representation, Computers and Industrial Engineering, 30(4), 983-997.
DOI
ScienceOn
|
4 |
Chiang, T. C. and Fu, L. C. (2006), Multiobjective job shop scheduling using genetic algorithm with cyclic fitness assignment, Proceedings of the IEEE Congress on Evolutionary Computation, Vancouver, Canada, 3266-3273.
|
5 |
Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T. (2002), A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, 6(2), 182-197.
DOI
ScienceOn
|
6 |
Garey, M. R., Johnson, D. S., and Sethi, R. (1976), The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1(2), 117-129.
DOI
ScienceOn
|
7 |
Goncalves, J. F., de Magalhaes Mendes, J. J., and Resende, M. G. C. (2005), A hybrid genetic algorithm for the job shop scheduling problem, European Journal of Operational Research, 167(1), 77-95.
DOI
ScienceOn
|
8 |
Horn, J., Nafpliotis, N., and Goldberg, D. E. (1994), A niched Pareto genetic algorithm for multiobjective optimization, Proceedings of the 1st IEEE Congress on Evolutionary Computation, Orlando, FL, 82-87.
|
9 |
Kennedy, J. and Eberhart, R. C. (1995), Particle swarm optimization, Proceedings of the IEEE International Conference on Neural Networks, Perth, WA, 1942-1948.
|
10 |
Lei, D. (2008), A Pareto archive particle swarm optimization for multi-objective job shop scheduling, Computers and Industrial Engineering, 54(4), 960-971.
DOI
ScienceOn
|
11 |
Lei, D. and Wu, Z. (2006), Crowding-measure-based multiobjective evolutionary algorithm for job shop scheduling, International Journal of Advanced Manufacturing Technology, 30(1-2), 112-117.
DOI
|
12 |
Lei, D. M. and Xiong, H. J. (2007), An efficient evolutionary algorithm for multi-objective stochastic job shop scheduling, Proceedings of the 6th International Conference on Machine Learning Cybernetics, Hong Kong, 867-872.
|
13 |
Nowicki, E. and Smutnicki, C. (1996), A fast taboo search algorithm for the job shop problem, Management Science, 42(6), 797-813.
DOI
ScienceOn
|
14 |
Liu, F., Qi, Y., Xia, Z., and Hao, H. (2009), Discrete differential evolutionary algorithm for the job shop scheduling problem, Proceedings of the 1st ACM/ SIGEVO Summit on Genetic and Evolutionary Computation, Shanghai, China, 879-882.
|
15 |
Matsuo, H., Suh, C. J., and Sullivan, R. S. (1988), A controlled search simulated annealing method for the general job-shop scheduling problem, Working Paper #03-04-88, Graduate School of Business, The University of Texas at Austin, Austin, TX.
|
16 |
Nguyen, S. and Kachitvichyanukul, V. (2010), Movement strategies for multi-objective particle swarm optimization, International Journal of Applied Metaheuristic Computing, 1(3), 59-79.
DOI
|
17 |
Pongchairerks, P. and Kachitvichyanukul, V. (2009a), A two-level particle swarm optimisation algorithm on job-shop scheduling problems, International Journal of Operational Research, 4(4), 390-411.
DOI
|
18 |
Pongchairerks, P. and Kachitvichyanukul, V. (2009b), Particle swarm optimization algorithm with multiple social learning structures, International Journal of Operational Research, 6(2), 176-194.
DOI
|
19 |
Ponnambalam, S. G., Ramkumar, V., and Jawahar, N. (2001), A multiobjective genetic algorithm for job shop scheduling, Production Planning and Control, 12(8), 764-774.
DOI
|
20 |
Pratchayaborirak, T. and Kachitvichyanukul, V. (2011), A two-stage PSO algorithm for job shop scheduling problem, International Journal of Management Science and Engineering Management, 6(2), 84-93.
|
21 |
Ripon, K. S. N., Tsang, C. H., and Kwong, S. (2006), Multi-objective evolutionary job-Shop scheduling using jumping genes genetic algorithm, Proceeding of the International Joint Conference on Neural Networks, Vancouver, Canada, 3100-3107.
|
22 |
Van Laarhoven, P. J. M., Aarts, E. H. L., and Lenstra, J. K. (1992), Job shop scheduling by simulated annealing, Operations Research, 40(1), 113-125.
DOI
ScienceOn
|
23 |
Rookkapibal, L. and Kachitvichyanukul, V. (2006), Particle swarm optimization for job shop scheduling problems, Proceedings of the 36th CIE Conference on Computers and Industrial Engineering, Taipei.
|
24 |
Shi, Y. and Eberhart, R. (1998), A modified particle swarm optimizer, Proceedings of the IEEE World Congress on Computational Intelligence Evolutionary Computation, Anchorage, AK, 69-73.
|
25 |
Udomsakdigool, A. and Kachitvichyanukul, V. (2006), Two-way scheduling approach in ant algorithm for solving job shop problems, International Journal of Industrial Engineering and Management Systems, 5(2), 68-75.
|
26 |
Veeramachaneni, K. , Peram, T., Mohan, C., and Osadciw, L. A. (2003), Optimization using particle swarms with near neighbor interactions, Proceedings of the International Conference on Genetic and Evolutionary Computation, Chicago, IL, 110-121.
|
27 |
Wisittipanich, W. and Kachitvichyanukul, V. (2012), Two enhanced differential evolution algorithms for job shop scheduling problems, International Journal of Production Research, 50(10), 2757-2773.
DOI
ScienceOn
|
28 |
Yamada, T. and Nakano, R. (1995), A genetic algorithm with multi-step crossover for job-shop scheduling problems, Proceedings of the 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, Sheffield, UK, 146-151.
|
29 |
Zitzler, E. and Thiele, L. (1999), Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach, IEEE Transaction on Evolutionary Computation, 3(4), 257-271.
DOI
ScienceOn
|
30 |
Zitzler, E., Laumanns, M., and Thiele, L. (2001), SPEA2: improving the strength Pareto evolutionary algorithm, TIK Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Zurich, Switzerland.
|