Makespan Minimization in Job Shop Scheduling

  • K. Sathya Sundari Part time category-B Research Scholar, Research & Development Centre, Bharathiar University, Coimbatore, Tamil Nadu, INDIA
Keywords: Makespan, Minimization, Job Shop, Scheduling

Abstract

In industries, the completion time of job problems in the manufacturing unit has risen significantly. In several types of current study, the job's completion time, or makespan, is reduced by taking straight paths, which is time-consuming. In this paper, we used an Improved Ant Colony Optimization and Tabu Search (ACOTS) algorithm to solve this problem by precisely defining the fault occurrence location in order to rollback. We have used a short-term memory-based rollback recovery strategy to minimise the job's completion time by rolling back to its own short-term memory. The recent movements in Tabu quest are visited using short term memory. As compared to the ACO algorithm, our proposed ACOTS-Cmax solution is more efficient and takes less time to complete.

Downloads

Download data is not yet available.

References

C.L. Wang. G. Rong. W. Weng., & Y.P. Feng. (2015). Mining scheduling knowledge for job shop scheduling problem. In: IFAC (International Federation of Automatic Control), pp. 800–805.

Zengqiang Jiang, Le Zuo, & Mingcheng E. (2014). Study on multi-objective flexible job-shop scheduling problem considering energy consumption. Journal of Industrial Engineering and Management, 7(3), 589-604.

Farooq Ahmad & SherAfzal Khan. (2012). Module-based architecture for a periodic job-shop scheduling problem. Computers & Mathematics with Applications, pp 1- 10.

M. S. Al-Ashhab, Shadi Munshi, Mowffaq Oreijah, Hamza & A. Ghulman. (2017). Job shop scheduling using mixed integer programming. International Journal of Modern Engineering Research, 7(3), 23-29..

Habibeh Nazif. (2015). Solving job shop scheduling problem using an ant colony algorithm. Journal of Asian Scientific Research, 5(5), 261-268.

Deepak Gupta & Sonia Goel. (2019). Two-stage flow shop scheduling model including transportation time with equipotential machines at every stage. International Journal of Innovative Technology and Exploring Engineering (IJITEE), 8(12), 5090-5094.

Evgeny Gafarov & Frank Werner. (2019). Two-machine job-shop scheduling with equal processing times on each machine. Available at: https://www.mdpi.com/2227-7390/7/3/301.

Yi Sun, Chaoyong Zhang, Liang Gao, & Xiaojuan Wang. (2011). Multi-objective optimization algorithms for flow shop scheduling problem: A review and prospects. Int J Adv Manuf Technol., 55, 723-739.

Jian Zhang, Guofu Ding, YishengZou, Shengfeng Qin, & Jianlin Fu. (2017). Review of job shop scheduling research and its new perspectives under Industry 4.0. Journal of Intelligent Manufacturing, 30(4), 1809-1830.

Kavita Kalambe, Sunita Rawat, Nilesh Korde, & Gaurav Kawade. (2019). Integrated cache scheduling replacement algorithm to reduce cache pollution. International Journal of Recent Technology and Engineering (IJRTE), 8(2), 3471-3475.

Published
2021-02-27
How to Cite
K. Sathya Sundari. (2021). Makespan Minimization in Job Shop Scheduling. International Journal of Engineering and Management Research, 11(1), 228-230. https://doi.org/10.31033/ijemr.11.1.31