THE COORDINATION OF MANUFACTURING CYCLES BY THE METHOD OF MUTUAL PENALTIES
The article deals with an algorithm of the product manufacturing cycle coordination implemented in the SAPFORD system when planning the make-to-order production. MES-Systems well-known in the Russian market, which are intended for the machine scheduling calculation and based on branching schemes, are not effective for the plant scheduling in real time. When scheduling design problem solving, author shows that the specific details of the machine scheduling of make-to-order manufacturing allow using the effective methods like task decomposition, co-ordination of the sub-task criteria against each other and with the universal criterion of optimality. The make-to-order manufacturing scheduling task is broken to subtasks of the detail and process distribution through workplaces with preset parameters in a reasonable amount of time. The criterion estimation of the cost-push during delay or abnormal end of the operation is calculated for each operation. The method of the mutual penalties allows to implement the coordination of subtask criteria, whereby details and operations engaged in competition in queue impose to each other penalties like estimation of costs caused by delay. The proposed algorithm provides an effective planning of the make-to-order manufacturing based on a unified machine scheduling with no limits on initial data scope for product range and manufacturing processes. The favourable environment is created for paralleling the problem solving process, which in turn allows to use all the multiprocessor system resources. Author gives examples for problem solving.