International Journal of Engineering
Trends and Technology

Research Article | Open Access | Download PDF

Volume 29 | Number 1 | Year 2015 | Article Id. IJETT-V29P217 | DOI : https://doi.org/10.14445/22315381/IJETT-V29P217

Development of a Scheduling Heuristic for the Fabrication Shop of a Sheet Metal Processing Industry


Ranbir Kalita, Ajoy Krishna Dutta, P. B. Barua

Citation :

Ranbir Kalita, Ajoy Krishna Dutta, P. B. Barua, "Development of a Scheduling Heuristic for the Fabrication Shop of a Sheet Metal Processing Industry," International Journal of Engineering Trends and Technology (IJETT), vol. 29, no. 1, pp. 87-90, 2015. Crossref, https://doi.org/10.14445/22315381/IJETT-V29P217

Abstract

Machine idle time is one of the main causes for lower machine utilization and prevents the use of its full potential and capacity. As a result, the value of average flow time and makespan increases and becomes a reason for production and delivery delays. Since the last few decades, a number of scheduling and sequencing techniques have been developed by many researchers to minimize these causes. Among them, most techniques are concerned with decreasing average flow time and makespan value. In this paper also, a new heuristic technique is developed for decreasing such causes. The results are compared with that obtained by using some standard dispatching rules and found that the developed heuristic algorithm is performing better in minimizing the values of makespan, average flow time and number of machine set ups required.

Keywords

Machine idle time, average flow time, makespan, sequencing and scheduling, dispatching rule, heuristics.

References

[1] “Operations Research” (6th Revised Edition, 2012), Prem Kumar Gupta, Dr. D.S. Hira, pp. 412 – 441, S. Chand Publication, ISBN 81-219-0281-9, Code: 10B 087.
[2] P. B. Barua, P. C. Pandey and C. K. Singh (1986) “Machine Loading and Product Mix in Group Technology Based Manufacturing Systems”, Proceeding of the 12th All India Machine Tool design and Research Conference, pp. 474 – 477, held at IIT, Delhi, 10 – 12 December, 1986.
[3] K. Luchoomun, P. Auckloo, B. Sonah (July 2014) “Enhancing Performance of Genetic Algorithm for Static Job-Shop Scheduling Problems”, International Refereed Journal of Engineering and Science (IRJES), Vol. 3, Issue 7, pp. 39-49, ISSN (Online) 2319-183X, (Print) 2319-1821.
[4] Vincent Lal, C. Anand Deva Durai (February 2014) “A Survey on Various Optimization Techniques with Respect to Flexible Job Shop Scheduling”, International Journal of Scientific and Research Publications, Vo. 4, Issue 2, pp. 1-7, ISSN 2250-3153.
[5] Nakandhrakumar, R. S., Seralathan, S., Azarudeen, A., Narendran, V., “Optimization of Job Shop Scheduling Problem using Tabu Search Optimization Technique”, 2014 International Conference on Innovations in Engineering and Technology (ICIET’14) on 21st & 22nd March, 2014, Organized by K.L.N. College of Engineering and Technology, Madurai, Tamil Nadu, India, Vo. 3, Special issue 3, pp. 1241-1244, ISSN (Online) : 2319 – 8753 and ISSN (Print) : 2347 – 6710.
[6] Kaban, A. K.; Othman, Z. and Rohmah, D. S. (2012), “Comparison on Dispatching Rules in Hob-Shop Scheduling Problem using simulation: A Case Study”, DOI: 10.2507/IJMIMM11(3)2.201, pp. 129-140, ISSN: 1726-4529.

Time: 0.0013 sec Memory: 32 KB
Current: 1.88 MB
Peak: 4 MB