A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM WITH CONSIDERATION OF PRODUCT-DEPENDENT TRANSPORTATION

Abstract

This paper investigates the lot scheduling problem for multiple products processed on a single machine, under a cyclical production sequence and dpterministic demand rate. The problem is formulated in the form of a demand and supply balance equation. with consideration of the method by which each product produced is transported from the single machine's location to spatially different mult.iple demand locat.ions. The paper ident.ifies condit.ions that. ensure the existene<' of a feasible product.ion lot schedule, and proves that the lot is a unique form of lot sizf'S for a feasible schedule over an infinite planning horizon. It is clarified that the balanced lot size is not ~ffected by the transportation method assigned to each product. The difference in transportation method only affects the amount of initial inventory required at the beginning of the horizon. These results are applied to the problem of finding a feasible production schedule over a finite planning period, and t.wo methods, utilizat.ion of t.he balanced lot size and application of the balance equation, are presented and advantages of each method are discussed.