納期指定のある多種類注文の逐次到着バッチ処理

概要

論文の詳細を見る
Various orders with due-date arrive sequentially at a production facility. These are classified into m types when put into processing. As changing of the processing type (order type) requires long set-up time, we wish to construct a production batch and process as many of the same-type orders as possible for one set-up. In addition, as each order has its strict due-date, on its arriving, we must collate its due-date with the batch processing schedule decided in advance, and reject the order which does not meet its due-date. The objective is to decide the above-mentioned batch processing schedule in advance, i.e., to make simultaneously batch size and sequencing decisions, so as to maximize the expected order processing quantity per unit time. This paper formulates the problem into a deterministic model, analyses its structures, and presents a simple algorithm of obtaining a good schedule.
東海大学の論文