1 |
Cheng, R., Gen, M., and Tsujimura, Y. (1999), A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies, Computers and Industrial Egningeering, 36, 343-364.
DOI
ScienceOn
|
2 |
Hsieh, C., Chou, J., and Wu, Y. (2000), Taguchi-MHGA method for optimizing grey-fuzzy gain-scheduler, Proceedings of the 6th International Conference on Automation Technology, Taiwan, 575-582.
|
3 |
Leung, Y. and Wang, Y. (2001), An orthogonal genetic algorithm with quantization for global numerical optimization, IEEE Transactions on Evolutionary Computation, 5, 41-53.
DOI
ScienceOn
|
4 |
Cheng, R., Gen, M., and Tsujimura, Y. (1996), A tutorial survey of job-shop scheduling problems using genetic algorithms, part I: representation, Computers and Industrial Egningeering, 30, 983-996.
DOI
ScienceOn
|
5 |
Schaffer, J. D., Caruana, R. A., Eshelman, L. J., and Das, R. (1989), A study of control parameter affecting online performance of genetic algorithms for function optimization, Proceedings of the 3rd International Conference on Genetic Algorithms, Arlington, VA.
|
6 |
Gupta, M, Gupta, Y., and Kumar, A. (1993), Minimizing flow time variance in single machine system using genetic algorithms, European Journal of Operations Research, 70, 289-303.
DOI
ScienceOn
|
7 |
Holland, J. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press.
|
8 |
Koonce, D. A. and Tsai, S. C. (2000), Using data mining to find patterns in genetic agorithm solutions to a job shop schedule, Computers and Industrial Engineering, 38, 361-374.
DOI
ScienceOn
|
9 |
Pakath, R. and Zaveri, J. S. (1993), Specifying critical inputs in a genetic-driven decision support system: an automated facility, Working Paper, University of Kentucky, Lexington.
|
10 |
Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning. Reading, Massachusetts: Addison Wesley.
|
11 |
Sun, J. U., Yee, S. R., and Hwang, H. (2003), Job shop scheduling with sequence dependent setup times to minimize makespan, International Journal of Industrial Engineering-Theory, Applications And Practice, 10, 455-461.
|
12 |
Phadke, M. S. (1989), Quality engineering using robust design, Prentice-Hall International.
|
13 |
Liu, T., Tsai, J., and Chou, J. (2006), Improved genetic algorithm for the job-shop scheduling problem, International Journal of Advanced Manufacturing Technology, 27, 1021-1029.
DOI
|
14 |
Ballas, E. (1969), Machine sequencing via disjunctive graphs: an implicit enumeration approach, Operations Research, 17, 941-957.
DOI
ScienceOn
|
15 |
Ovacik, I. M. and Uzsoy, R. (1997), Decomposition methods for complex factory scheduling problems, Norwell, MA: Kluwer Academic.
|
16 |
Chen, C. L., Vempati, V. S., and Aljaber, N. (1995), An application of genetic algorithms for flow shop problems, European Journal of Operations Research, 80, 389-396.
DOI
ScienceOn
|
17 |
Lee, C. Y. and Choi, J. Y. (1995), A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights, Computers and Operations Research, 22, 857-869.
DOI
ScienceOn
|