Abstract
The purpose of a job-shop scheduling problem (JSP) is to find a schedule with the minimum makespan. In the scheduling problem in the real world, in addition, it is necessary to consider the delivery time and the holding cost. In JSP with the delivery time (JSPD) proposed by Asano et al., the holding cost of the product completed before the delivery time is not considered.
In this paper, we propose a new model (JSPDH) from which the concept of the holding cost is added to JSPD, and we propose a method for solving JSPDH by a genetic algorithm. The effectiveness of the proposed method is clarified by numerical experiments using benchmark problems for a job-shop scheduling.
