Untitled Document
Home | About Us | Contact
21 Nov 2017
10:38 PM
Go Social :
Untitled Document
     Authors Desk
 
Detail of This Paper

Year 2013
Title Evaluation of Minimum Makespan using Modified Evolutionary Algorithm
Authors Bhanu Prasad Behera , Dr.Rati Ranjan Das , Dr.Arun Kumar Panda
Broad area Mechanical Engineering
Abstract
 In this work a process of flow shop scheduling problem is considered taking an objective to minimize the makespan. In order to create different varieties of solutions, evolutionary algorithm heuristic is used. An optimized solution for the problem is evaluated from the
solution pool. The scheme is applied to some benchmark problem in this area and the effectiveness is tested.
Description
File 948586472_Evaluation_of_Minimum_Makespan_using_Modified_Evol.pdf
Referenceses
 [1]. T.C.E. Cheng , C.T. Ng , J.J. Yuan, “Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time” , European Journal of Operational Research 191 (2008) 320–331
[2]. Xianyi Wu , Xian Zhou, “Stochastic scheduling to minimize expected maximum lateness” , European Journal of Operational Research 190 (2008) 103–115
[3].Reeves, C. R. and Beasley, J. E. (1995), Chapter 1 in Reeves, C. R. (ed.) Modern heuristic techniques for combinatorial problems, McGraw-Hill, London.
[4].Silver, E. A., Vidal, R. V. V. and de Werra, D. (1980), “A tutorial on heuristic methods”, European Journal of Operational Research, Vol. 5, pp. 153-162.
[5].Mendez, C. A., Cerda, J., Grossmann, I. E., Harjunkoski, I., & Fahl, M. (2006). State-of-the-art review of optimization methods for short-term scheduling of batch processes. Computers and Chemical Engineering, 30(6/7), 913– 946.
[6].T. Back, U.Hammel and H. Schwefel. ‘Evolutionary Computation: Comments on history and current state.’ IEEE Trans. on Evolutionary Comput, April 1997, p3.
[7]. T. Back, and H. Schwefel.’An overview of Evolutionary Algorithm for parameter optimization.’ on Evolutionary Comput, vol 1, no 1, 1998, p1.
[8] Yongming Wang and Nanfeng Xiao Hongli Yin and Enliang Hu, “A Two-Stage Genetic Algorithm for Large-Size Scheduling Problem Proceedings of the IEEE, International Conference on Automation and Logistics August 18 - 21, 2007, Jinan, China
[9] Yamada, T. and Nakano, R. (1992): A Genetic Algorithm  Applicable to Large-Scale Job-Shop Problems, Parallel Problem Solving from Nature, Vol. 2, pp.281-290 (1992) 
[10].Adams.J, Balas .E, and Zawack. D,(1988), Shifting bottleneck Procedure for Jobshop Scheduling, Management Science, Vol.34, No.3 pp. 391-401(1988)
[11] M.C. Portman, “Scheduling methodologies: optimization and comp search approaches,” A. Artiba and S. E. Elmagharaby (ed.), The Planning and Scheduling of Production Systems, Chap.9, 1997, pp. 271–300.
[12]. M. Gen, Y. Tsujimura and E. Kubota, “Solving job-shop scheduling problem using genetic algorithms,” Proc. of the 16th Int. Conf. on Computer and Industrial Engineering, Ashikaga, Japan, 1994, pp. 576- 579.
[13]. Goldberg, D. E. (1989), Genetic algorithms in search, optimization and machine learning, Addison-Wesley.

 

Untitled Document
 
Copyright ©2017 PICCO Engineering, Cuttack