Makespan Minimization in Job Shop Scheduling

Authors

  • K. Sathya Sundari Part time category-B Research Scholar, Research & Development Centre, Bharathiar University, Coimbatore, Tamil Nadu, INDIA

DOI:

https://doi.org/10.31033/ijemr.11.1.31

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

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