| 摘要 |
PURPOSE:To propose a method for solving scheduling problems when there are plural buffers for storing products so that plural facilities can be used in common for many kinds of production until products obtained by a 1st process consisting of the facilities are passed to a next production process. CONSTITUTION:The restrictions of the capacity of the buffers are replaced with time restrictions to result into one machine problem and the priority relation among jobs is formulated into an integer planning problem represented with variables 0 and 1. This problem is solved by a branch limiting method, but contracted by formulating the variables 0 and 1 in advance. The target function of the integer planning problem indicates a total buffer stay time and an optimum solution minimizes it, but a strict lower-limit value is derived in the process of solving it and utilized. |
