Method And System Of Workshop Scheduling Based On Small-Batch Production

The production mode of most manufacturing enterprises is turning to small batchalong with the intense competition of the market, so the job shop scheduling problemhas become a typical scheduling problem. The problem investigated in this paper is an extension of the classical job shopscheduling problem that relaxes the restriction of resource. The paper firstlyintroduces an algorithm based on priority to solve this complicated combiningoptimization problem. The rule of maximal comparative remaining operating time isused to choose the part when operations of different parts compete one machine. Therule of least waiting time of the part on a machine is used to choose the machinewhen an operation of a part has more than one usable machine. This algorithm isproven to be effective by examples. Secondly, the paper analyses the application of data mining in the schedulingproblem. It puts forward the method of finding combinatorial rules by decision treebased on ID3 algorithm. The hidden rules of sequencing can be mined form historicaldata to solve the problem of operations of different parts competing one machine. Bymeans of practical examples, the detail steps of this algorithm are expatiated and itsfeasibility is proven. Finally, the paper discusses the design scheme of production scheduling systemin the small batch workshop. The system is analyzed and designed by modeling tools.The function modules and the realizing technologies are introduced in detail. Aprototype system is developed.