Abstract
This paper deals with a lot-scheduling problem of multiple items processed on a machine under JIT environment where all the parts have a common due date. The performance measure used is the actual flow times providing with both receiving-raw-material-just-in-time and shipping-finished-part-just-in-time. The problem is divided into two subproblems, namely, the subproblems of lot sizing and scheduling the resulting lots. The solution method for the subproblem of lot sizing and that for the subproblem of scheduling could separately be optimal. However, since each subproblem is not independent of the other, the proposed method solving the problem of lot-scheduling is to be considered a heuristic method.
