Optimization Models for Scheduling of Jobs.
This work is motivated by a particular scheduling problem that is faced by logistics centers that perform aircraft maintenance and modification. Here we concentrate on a single facility (hangar) which is equipped with several work stations (bays). Specifically, a number of jobs have already been scheduled for processing at the facility; the starting times, durations, and work station assignments for these jobs are assumed to be known. We are interested in how best to schedule a number of new jobs that the facility will be processing in the near future. We first develop a mixed integer quadratic programming model (MIQP) for this problem. Since the exact solution of this MIQP formulation is time consuming, we develop a heuristic procedure, based on existing bin packing techniques. This heuristic is further enhanced by application of certain local optimality conditions.
Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-0975.
S H Sathish
SH
Indika
Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-0975.
Douglas R
DR
Shier
aircraft; bin packing; heuristic; integer programming; maintenance; optimization; scheduling