Skip to Main Content
The aim of this paper is to research an existing just-in-time scheduling problems. Moreover, we propose a new algorithm for a just-in-time scheduling problem, and perform a comparison between it and an existing algorithm. The proposed algorithm has been based on the greedy algorithm. The greedy algorithm is the search method updating a solution in the direction where the improvement effect of the purpose function is the most remarkable only based on local information. As a result, we succeeded in introducing a new algorithm with a faster processing time than an existing algorithm.