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.
Similar content being viewed by others
References
Aranout JP, Rabadi G, Musa R (2010) A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J Intell Manuf 21: 693–701
Baker BS, Coffman EG, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9: 846–855
Chen CS, Lee SM, Shen QS (1995) An analytical model for the container loading problem. Eur J Oper Res 80: 68–76
Cho KK, Chung KH, Park C, Park JC, Kim HS (2001) A spatial scheduling system for block painting process in shipbuilding. CIRP Ann Manuf Technol 50: 339–342
Duin CW, Van Sluis E (2006) On the complexity of adjacent resource scheduling. J Schedul 9: 49–62
Fleszar K, Charalambous C, Hindi KS (2012) A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. J Intell Manuf (In Press)
Garcia C, Rabadi G (2009) An optimization model for scheduling problems with two-dimensional spatial resource constraints. In: Proceedings of Modeling and Simulation (MODSIM) World Conference (2009) Virginia Beach
Hopper E, Torton BCH (2001) An empirical investigation on metaheuristic and heuristic algorithms for a 2D packing problem. Eur J Oper Res 128: 34–57
Hurink JL, Kok AL, Paulus JJ, Schutten JMJ (2011) Time-constrained project scheduling with adjacent resources. Comput Oper Res 38: 310–319
Lee KJ, Lee JK (1996) A spatial scheduling system and its application to shipbuilding: DAS-Curve. Expert Syst Appl 10: 311–324
Montgomery DC (2001) Design and analysis of experiments. Wiley, New York
Padberg M (2000) Packing small boxes into a big box. Math Methods Oper Res 52: 1–21
Paulus JJ, Hurink J (2006) Adjacent resource scheduling: why spatial resources are so hard to incorporate. Electron Notes Discrete Math 25: 113–116
Pinedo M (2008) Scheduling theory, algorithms and systems, 2nd edn. Springer, New York
Rabadi G, Moraga R, Al-Salem A (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. J Intell Manuf 17: 85–97
Ruby (2010) http://www.ruby-lang.org/en, the Ruby language web site
Scheduling Research (2005) http://www.schedulingresearch.com, a web site that includes benchmark problems data sets and solutions for scheduling problems
Silberschats A, Galvin PB, Gagne G (2009) Operating system concepts, 8th edn. Wiley, New York
Varghese R, Yoon, DY (2005) Spatial block arrangement in shipbuilding industry using genetic algorithm for obtaining solution for anticipated bottleneck. In: Proceedings of the fifteenth international offshore and polar engineering conference, vol 4, pp 774–780
Weng M, Lu J, Ren H (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int J Prod Econ 70: 215–226
Yu W, Li W, Goh M, de Souza R (2010) Three-dimensional bin-packing problem with variable bin height. Eur J Oper Res 202: 347–355
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Garcia, C., Rabadi, G. Exact and approximate methods for parallel multiple-area spatial scheduling with release times. OR Spectrum 35, 639–657 (2013). https://doi.org/10.1007/s00291-012-0301-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-012-0301-8