Abstract
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 us an approximate schedule with minimum flow time. This method produces many small size scheduling problems under the same divided-delivery condition as a real large size problem. And this method saves some characters of optimal schedules produced by Branch & Bound Method about these small size problems. Then, this method approaches a real large sim problem making use of these characters. In this paper, we show the algorism and the performance of this method.
