Indian Journal of Science and Technology

Abstract

This article is related to concept of preemption in just-in-time single machine shop with allowable machine idle time. According to the operation research model of this problem, Lingo software can easily solve small problems, but it cannot solve the average and big problems. The purpose of this article is to provide a simulated annealing algorithm for solving this problem. The suggested simulated annealing algorithm gives the answers, which are quite close to the optimal solution in the tested problems. The runtime solution problem by using the suggested algorithm is much less than by using the Lingo software. The numerical examples show that the efficiency of SA algorithm is quite high.
Keywords: Just-in-time scheduling, single machine, preemption, machine idle time, simulated annealing algorithm