Multi Objective Optimization in Scheduling of FMS Using Roulette Wheel Selection Process

Abstract:

Most of real-life engineering problems are objectives optimization problems. In many cases objectives under consideration conflict with each other and optimizing a particular solution with respect to a single objective can result in unacceptable results with respect to the other.FMS Scheduling problem is considered as one of the most difficult NP-hard combinatorial optimization problems. Therefore, determining an optimal schedule and controlling an FMS is considered a difficult task. It is difficult for traditional optimization techniques to provide the best solution. In this paper, we propose a multi-objective genetic algorithm for effectively solving job processing FMS Scheduling problem. An attempt has been made to generate a schedule using Genetic Algorithm with Roulette Wheel Base Selection Process to minimize Total Make Span Time and to maximize machine utilization time.

• Periodical: Advanced Materials Research (Volumes 622-623)
• Pages: 35-39
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.622-623.35
• Online since: December 2012
• Authors: Durgesh Sharma, Suresh Garg, Chitra Sharma
• Keywords: FMS, Genetic Algorithm (GA), Machine Utilization, Make Span Time, Roulette Wheel Selection, Scheduling

References

[1] S. S. Panwalker and W. Iskander, A survey of scheduling rules., (1977).

[2] Blackstone, J. H. Phillips, and G. L. Hogg, A State-Of-Art survey of dispatching rules for manufacturing job shop operations, International Journal Of Production , (1982).

DOI: 10.1080/00207548208947745

[3] K. R. Baker, Sequencing rules and due-date assignments in a job shop, Management Science, pp.1093-1103, (1984).

DOI: 10.1287/mnsc.30.9.1093

[4] R. S. Russel, E. M. Dar-EI, and B. W. Taylor, A comparative analysis of the COVERT job sequencing rules using various shop performance measures, International Journal of Production Research, pp.1523-1540, (1987).

DOI: 10.1080/00207548708919930

[5] A.P. J. Vaspalainen and T. E. Mortan, Priority rules for job shops with weighted tardiness Costs, Management Science, pp.1035-1047, (1987).

DOI: 10.1287/mnsc.33.8.1035

[6] R. Ramasesh, Dynamic job shop scheduling: a survey of simulation studies., OMEGA: The International Journal of Management Science, pp.43-57, (1990).

DOI: 10.1016/0305-0483(90)90017-4

[7] H. Cho and R. A. Wysk, A robust adaptive scheduler for an intelligent workstation controller, Internatioal Journal Of Production Research, pp.771-789, (1993).

DOI: 10.1080/00207549308956756

[8] H. Kopfer and C. Mattfield, A hybrid search algorithm for the job shop, in Proceedings of the First International Conference on Operations and Quantitative Management, 1997, pp.498-505.

[9] J. Schultz and P. Mertens, A comparison between an expert system, a GA and priority for production scheduling, in Proceedings of the First International Conference on Operations and Quantitative Managemen v, 1997, pp.505-513.

[10] J.E. Biegel and J.J. Davern, Genetic Algorithm and Job Shop Scheduling, Computers and Industrial Engineering, vol. 19, no. 1-4, pp.81-91, (1990).

DOI: 10.1016/0360-8352(90)90082-w

[11] R.E. Billo, B. Bidanda, and D. Tate, A genetic algorithm formulation of the cell formation problem , in Proceedings of the 16 th International Conference on Computers and Industrial Engineering, 1994 , pp.341-344.

[12] U. Dorndorf and E. Pesch, Evolution Based Learning in a Job Shop Scheduling Environment, Computers and Operations Research, vol. 22, no. 1, pp.25-40, (1995).

DOI: 10.1016/0305-0548(93)e0016-m

[13] M. Pinedo, Scheduling: theory algorithms and systems, Englewood. NJ: Prentice-Hall, (2002).

[14] K.A. DeJong and W.M. Spears An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms, Proc. First Workshop Parallel Problem Solving from Nature, Springer-Verlag, Berlin, 1990, pp.38-47.

DOI: 10.1007/bfb0029729