ILOG Based Discrete Job-Shop Scheduling System

Job-Shop Scheduling System (JSSS hereinafter for short)，which is a key part ofproduction management, is mainly used to solve the scheduling and resource allocationproblem in the production process. Optimization of the JSSS has significant impact on somekey indexes, such as equipment utilization efficiency, cost resulted from order delays, and so on.As domestic JSSS’s narrow application, poor interactivity and weak practicality, this paperbuilds a JSSS framework for discrete job-shop environment combining task allocation problemwith Job-Shop Scheduling Problem (JSSP hereinafter for short) based on the ILOGtechnology.Firstly, the multi-agent task allocation problem is deeply studied in the paper. Afteranalyzing some objective functions of the problem, the paper determines the weights for theselected objective functions with the method of Analytic Hierarchy Process (AHP), convertsmulti-agent task allocation problem to a single-objective optimization problem. And then, thepaper presents a Genetic Algorithm (GA hereinafter for short) for a task allocation problem ina heavy equipment manufacturing industry.Secondly, the algorithm of JSSP is optimized. After establishing a model with theobjective function of minimizing makespan, the paper analyzes the advantages of powerfulglobal search ability and shortcomings of easy premature convergence of Simple GeneticAlgorithm and constructs an improved GA by MATLAB GA toolbox. Through the classicalJSSP certification, the algorithm can effectively solve the job-shop scheduling problem.Lastly, to the workshop characteristics of a heavy equipment manufacturing industry, thepaper constructs a framework of discrete JSSS based on ILOG. The frame of this JSSS has agood user interface and easy operation, which can realize the scheduling results comparison ofmultiple schemes. These characteristics of the JSSS frame establish its practicality foundation.