Just-in-time scheduling with machining economics for single-machine turning process

Traditional machining economics looks into the optimal set of machining con ditions under which the production cost or time per part is minimized. No d ue dates are included in the consideration. Job sequencing searches for the optimal order of jobs so that lateness and/or earliness is minimized. The optimization assumes that processing times are fixed. In practice, processi ng times are variable within a certain range by adjusting the combination o f machining conditions. This paper presents the modeling of a machining seq uencing problem that is integrated with the lower-level machining process o ptimization problem of a turning process in a justin-time delivery environm ent. A combination of dynamic programming and an enumerative procedure is u sed to solve the optimization problem.