[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.7737/MSFE.2014.20.2.033

Minimizing the Total Stretch in Flow Shop Scheduling

Yoon, Suk-Hun (Department of Industrial and Information Systems Engineering, Soongsil University)

Publication Information

Management Science and Financial Engineering / v.20, no.2, 2014 , pp. 33-37 More about this Journal

Abstract

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).

Keywords

Scheduling; Flow Shop; Stretch; Genetic Algorithms;

Citations & Related Records

Reference

1	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. DOI ScienceOn
2	Pinedo, M. L,, Scheduling: Theory, Algorithms, and Systems (4th Ed.), Springer, New York, 2012.
3	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. DOI ScienceOn
4	Baker, K. R. and D. Trietsch, Principle of Sequencing and Scheduling, Wiley, New Jersey, 2009.
5	Bender, M. A., S. Muthukrishnan, and R. Rajaraman, "Approximation algorithms for average stretch scheduling," Journal of Scheduling 7 (2004), 195-222. DOI ScienceOn
6	Bhattacharyya, S., "Direct marketing performance modeling using genetic algorithms." INFORMS Journal on Computing 11 (1999), 248-257. DOI
7	Goldberg, D. E. Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
8	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. DOI
9	Liepins, G. E. and M. R. Hilliard, "Genetic algorithms: Foundation and applications," Annals of Operations Research 21, 1-4 (1989), pp. 31-58. DOI
10	Dreo, J., A. Petrowski, P. Siarry, and E. Taillard, Metaheuristics for Hard Optimization: Methods and Case Studies, Springer, New York, 2005.