Intelligent Engineering Systems through Artificial Neural Networks
40 GA for JSP with Delivery Time and Holding Cost
Download citation file:
This paper describes a job-shop scheduling problem (JSP) of processing product subject to no delay time job and minimizing the holding cost. These are two objective models of the minimum delivery delay time and minimum holding cost. In this paper, we describe the model of the goal programming method which has the delivery time and the holding cost (JSPDH) by genetic algorithms (GA). The effectiveness of the proposed method is clarified by numerical experiments using benchmark problems for job-shop scheduling.