A heuristic lot scheduling method making use of the optimal schedules’ characters-A study on production ordering system in lot production system

This paper deals with a heuristic scheduling method for combinatorial ‘lot size and lot sequence’ scheduling problem under the divided-delivery condition. This method gives an approximate schedule with minimum flow time. It produces many small size scheduling problems under the same divided-delivery condition as a real large size problem. The method saves some characters of optimal schedules produced by Branch & Bound Method about these small size problems. Then, this method approaches a real large size problem making use of these characters. In this paper, the authors show the algorithm and the performance of this method. [In Japanese.]