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

Abstract

Traditional machining economics looks into the optimal set of machining conditions under which the production cost or time per part is minimized. No due 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, processing times are variable within a certain range by adjusting the combination of machining conditions. This paper presents the modeling of a machining sequencing problem that is integrated with the lower-level machining process optimization problem of a turning process in a just-in-time delivery environment. A combination of dynamic programming and an enumerative procedure is used to solve the optimization problem.