Predictive/reactive scheduling with controllable processing times and earliness-tardiness penalties
IIE Transactions (Institute of Industrial Engineers)
Taylor & Francis
1080 - 1095
Item Usage Stats
In this study, a machine scheduling problem with controllable processing times in a parallel-machine environment is considered. The objectives are the minimization of manufacturing cost, which is a convex function of processing time, and total weighted earliness and tardiness. It is assumed that parts have job-dependent earliness and tardiness penalties and distinct due dates, and idle time is allowed. The problem is formulated as a time-indexed integer programming model with discrete processing time alternatives for each part. A linear-relaxation-based algorithm is used to assign the parts to the machines and to find a sequence on each machine. A non-linear programming model is proposed to find the optimal starting and processing times of the parts for a given sequence. The proposed non-linear programming model is converted to a minimum-cost network flow model by piecewise linearization of the convex manufacturing cost in the objective function. The proposed method is used to find initial schedules in predictive scheduling. The proposed models are revised to incorporate a stability measure for reacting to unexpected disruptions such as machine breakdown, arrival of a new job, delay in the arrival or the shortage of materials in reactive scheduling.