| Summary: | 博士 === 南華大學 === 企業管理系管理科學碩博士班 === 99 === A mathematical model which minimizes the production cost of an automatic and network-type multiple-order-production (MOP) system with restriction of time-phased order completion is presented. A step-by-step algorithm is described to find the minimal cost of production. In order to solve the combinatorial problems of the production rate, the machine cost, and numerous machines in parallel at each workstation of the production line, a feedback approach is also applied in the algorithm. An example of a large number of orders which is subdivided into different deadlines is shown to demonstrate the application of the algorithm that results in decreased production cost, enhanced production rate, improved efficiency of the production schedule, and on-time completion of production.
|
|---|
