참고문헌
- Baker, K. R. and D. Trietsch, Principle of Sequencing and Scheduling, Wiley, New Jersey, 2009.
- Bender, M. A., S. Muthukrishnan, and R. Rajaraman, "Approximation algorithms for average stretch scheduling," Journal of Scheduling 7 (2004), 195-222. https://doi.org/10.1023/B:JOSH.0000019681.52701.8b
- Bhattacharyya, S., "Direct marketing performance modeling using genetic algorithms." INFORMS Journal on Computing 11 (1999), 248-257. https://doi.org/10.1287/ijoc.11.3.248
- Chan, W.-T., T.-W. Lan, K.-S. Liu, and P. W. H. Wong, "New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling," Theoretical Computer Science 359 (2006), 430-439. https://doi.org/10.1016/j.tcs.2006.06.003
- Dreo, J., A. Petrowski, P. Siarry, and E. Taillard, Metaheuristics for Hard Optimization: Methods and Case Studies, Springer, New York, 2005.
- Goldberg, D. E. Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
- Lee, C.-Y., S. Piramuthu, and Y.-K. Tsai, "Job shop scheduling with a genetic algorithm and machine learning," International Journal of Production Research 35 (1997), 1171-1191. https://doi.org/10.1080/002075497195605
- Liepins, G. E. and M. R. Hilliard, "Genetic algorithms: Foundation and applications," Annals of Operations Research 21, 1-4 (1989), pp. 31-58. https://doi.org/10.1007/BF02022092
- Muthukrishnan, S., R. Rajaraman, A. Shaheen, and J. F. Gehrke, "Online scheduling to minimize average stretch," Siam Journal on Computing 34, 2 (2005), 433-452. https://doi.org/10.1137/S0097539701387544
- Pinedo, M. L,, Scheduling: Theory, Algorithms, and Systems (4th Ed.), Springer, New York, 2012.