Exact and approximate methods for parallel multiple-area spatial scheduling with release times

  • Authors:

  • Christopher Garcia;Ghaith Rabadi

  • Affiliations:

  • College of Business, University of Mary Washington, Fredericksburg, USA 22401;Department of Engineering Management and Systems Engineering, Old Dominion University, Norfolk, USA 23529

  • Venue:
  • OR Spectrum
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Spatial scheduling problems involve scheduling jobs that each require certain amounts of two-dimensional space within a processing area of limited width and length. Thus, this requires not only assigning time slots to each job but also locations and orientations within the limited physical processing space as well. Such problems, often encountered in shipbuilding and aircraft manufacturing, are generally difficult to solve, and there is a relatively small amount of literature addressing these problems compared to other types of scheduling. In this paper, we consider a particularly complex class of spatial scheduling problems that involve scheduling each job into one of several possible processing areas in parallel to minimize the total amount of tardy time. In addition, each job has a release time before which it may not be processed. We introduce two methods for solving this type of problem: an integer programming (IP) model and a heuristic algorithm. We perform computational tests and comparisons of each method over a large number of generated benchmark problems with varying characteristics, and also compare these to a more naïve heuristic. Solving the IP model was effective for small problems but required excessive amounts of time for larger ones. The heuristic was effective and produced solutions of comparable quality to the IP model for many problems while requiring very little computational time.