i-manager Publications

Non-Identical Parallel Machine Scheduling Using Simulated Annealing Technique

K. Raja*, C. Arumugam**, V. Sella durai***, K.M. Senthil Kumar****

*Senior lecturer ,Department of Mechanical Engineering, Kumaraguru College of Technology, Coimbatore.

**Selection Grade Lecturer,Mechanical Engineering Department of Coimbatore Institute of Technology, Coimbatore, India.

***Professor ,Mechanical Engineering Department of Coimbatore Institute of Technology, Coimbatore, India.

****Lecturer , Mechanical Engineering Department of Coimbatore Institute of Technology, Coimbatore, India.

Periodicity:August - October'2006
DOI : https://doi.org/10.26634/jfet.2.1.958

Abstract

A generalized model for analyzing any manufacturing system is essential to improve its performance measures. Non - traditional optimization technique such as Simulated Annealing technique provides a complete solution methodology for solving the shop floor scheduling problems. The problem considered in this study consists of non-identical machines employed in parallel. Jobs ranging from 10 to 100 are to be processed on any one of the five non identical parallel machines. The objective is to reduce the completion time of the jobs. Simulated annealing methodology has been adopted to reach the optimal sequence. It has been found that the suggested optimization procedure arrives at the optimal solution at a reasonable time and is also found to outperform the existing heuristics.

Keywords

Simulated Annealing, Makespan, Optimization, Non-identical Parallel Machine Scheduling.

How to Cite this Article?

K. Raja, C. Arumugam, V. Selladurai and K.M. Senthil Kumar (2006). Non-Identical Parallel Machine Scheduling Using Simulated Annealing Technique. i-manager’s Journal on Future Engineering and Technology, 2(1), 14-19. https://doi.org/10.26634/jfet.2.1.958

References

[1]. Aarts, E. H. L., Van Laarhoven, R J. M., Lenstra, J. K., and Ulder, L. J., (1994), "A computational Study of Local Search Algorithms for Job Shop Scheduling", ORSA Journal on Computing, 5,118-125.

[2], Conway, R.W., Maxwell, W.L., and Miller, L.W., (1967), Theory of Scheduling, Addison-Wesley, Reading, MA.

[3], Eck, B.T., and M. Pinedo., (1993), "On the minimization of the make-span subject to flow time optimality''- Operations Research, 41,797-801.

[4], Hari Balasubramaniam., Lars Monch., John Fowler., Michele Pfund., (2004)," Heuristic Scheduling of Jobs on Parallel batch machines with incompatible job families and unequal ready times". International Journal of Production Research, 42(18): 1621.

[5]. Hutchison, J., (1990), "Current and Future Issues Concerning FMS Scheduling", OMEGA International Journal of Management Science, 19 (6), 529- 537.

[6], Ibarra. O. H., and C. E. Kim., (1977), "Heuristic algorithms for scheduling independent tasks on non¬identical processes". Journal of the Association for Computing Machinery, 24,280-289.

[7], Jain, A., and S. Meeran., (1998), "A state of the art review of job-shop scheduling Techniques", University of Dundee, Dundee, Scotland.

[8], Jose, A. Ventura., Deecheol Kim., (2003)," Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints". Computers and Operations Research, 30( 13): 1945-1958.

[9], Jerald, J., Asokan, R, Prabaharan, G., Saravanan, R., (2005), "Scheduling optimization of flexible manufacturing systems using particle swarm optimization algorithm". International Journal of Advanced Manufacturing Technology, 25:964-971.

[10].J.Parthasarathy, S., C. Rajendran., (1998), "Scheduling to Minimize Mean Tardiness and Weighted Mean Tardiness in Flow shop and Flow line-based Manufacturing Cell", Computers and Industrial Engineering, 34 (2), 531 -546.

[11].J.Saravanan, R., Asokan, R, and Sachithanandam, M., (2001), "Comparative Analysis of Conventional and Non-Conventional Optimization Techniques for CNC Turning Process", International Journal of Advanced Manufacturing Technology, 17,471-476.

[12] .Saravanan, R., Asokan, R, and Vijayakumar, K., (2003), "Machining Parameters Optimization for Turning Cylindrical Stock into a Continuous Finished Profile Using Genetic Algorithm and Simulated Annealing", International Journal of Advanced Manufacturing Technology, 21,1-9.

[13] .Shmoys, D.B., and E. Tardos., (1993), "An approximation algorithm for the generalized assignment problem". Mathematical Programming, 62,461 - 474

[14] .Stuetzle, T., (1998),"An ant approach for the flow shop problem". Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT'98), Vol.3.Verlag Mainz, Aachen, Germany, pp, 1560-1564.

If you have access to this article please login to view the article or kindly login to purchase the article

Single Article

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Online	15	15

ADD TO CART

Options for accessing this content:

If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.