2301 A Solution of Job Shop Scheduling Problems using Mixed Integer Programming
Details
This paper describes a solution of a job shop scheduling problem focusing on operating orders for each machine. In this study, starting times of each job are restricted by directly before the operated job. The restrictions are based on the formulations for travelling salesman problems. The proposed formulations give an optimum schedule plan successfully for a tiny size of job shop scheduling problem for six products by six machines.
