Study And Implementation Of M×N Core Algorithm For PPC Under CIM

The spreading of CIMS has far-reaching influence to large-scale manufacture of our country in their transforming mechanism, deepening reformation and building up competition. MRPII is the pith of western manufacturing and the main part of CIMS of our country. But due to the shortcoming of MRPII itself, it cannot adopt to the Job-Shop type manufacture which make up the large part of our manufacture.The most important part of production planning and controlling is made out production plan timely and exactly. There are dozens of critical devices which restrict the production in Job-Shop production, but in standard MRPII, Production Plan never considered the optimization of material of these bottle blocks, this made the plan lost its accuracy. Critical Device Scheduling(CDS), the kernel in making PP, turned out to be a NPC problem, can be summed up to a kind of job-shop scheduling which deal with N kinds of parts to be processed in M kinds of machines. Core algorithm can complete the CDS. The completed CDS not only optimized the material of the bottle blocks, but also compounded the production of job shop with MRPII effectively. At the same time, core algorithm provided a new way to solve the M*N scheduling problem in actual application. Based on the improving of MRP to adapt to job shop, it also add the supporting to the changed plan, which corresponding to the varied require caused by the order form's random change.The whole system had successfully developed with Visual C++ under Window, so it has window's interface consistency charactered by WYSIWYG. Interchanged information frankly, PPCES improved the effectively of plan deciding greatly.The successful developed of core algorithm have certain propelling to CIMS' spreading in job shop enterprise, and provide a new method to solve the NP problem of unflowing job scheduling approximately.