Management Science and Financial Engineering

  • 제20권2호
  • /
  • Pages.33-37
  • /
  • 2014
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지
DOI QR코드

DOI QR Code

Minimizing the Total Stretch in Flow Shop Scheduling

  • Yoon, Suk-Hun (Department of Industrial and Information Systems Engineering, Soongsil University)
  • 투고 : 2014.11.05
  • 심사 : 2014.11.21
  • 발행 : 2014.11.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flow shop scheduling. HGA adopts the idea of seed selection and development in order to reduce the chance of premature convergence that may cause the loss of search power. The performance of HGA is compared with that of genetic algorithms (GAs).

키워드

참고문헌

  1. Baker, K. R. and D. Trietsch, Principle of Sequencing and Scheduling, Wiley, New Jersey, 2009.
  2. 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
  3. 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
  4. 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
  5. Dreo, J., A. Petrowski, P. Siarry, and E. Taillard, Metaheuristics for Hard Optimization: Methods and Case Studies, Springer, New York, 2005.
  6. Goldberg, D. E. Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
  7. 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
  8. 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
  9. 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
  10. Pinedo, M. L,, Scheduling: Theory, Algorithms, and Systems (4th Ed.), Springer, New York, 2012.