Skip to main content
SpringerLink
Log in

Approximation Algorithms for Spatial Scheduling

  • Chapter
  • First Online:
Book cover Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 236))

Abstract

Spatial scheduling problems involve a set of jobs which have spatial dimensions in addition to traditional scheduling considerations such as due dates or processing times. In these problems processing space is a limited resource, and the scheduling decisions must determine both when and where the each job will be processed as well as each job’s layout orientation. Spatial scheduling problems find many real-world applications in industries such as shipbuilding and aircraft assembly, where there is limited working space available and tasks utilize significant amounts of spatial resources in their completion. In this chapter we discuss spatial scheduling and present several heuristic and metaheuristic algorithms for this problem class.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Baker BS, Coffman EG, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9:846–855

    Article  Google Scholar 

  • Caprace J-D, Petcu C, Velarde G, Rigo M (2013) Optimization of shipyard space allocation and scheduling using a heuristic algorithm. J Mar Sci Technol 18(3):404–417

    Article  Google Scholar 

  • 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

    Google Scholar 

  • DePuy G, Whitehouse GE (2001) A simple and effective heuristic for the multiple resource allocation problem. Int J Prod Res 32(4):24–31

    Google Scholar 

  • DePuy GW, Moraga RJ, Whitehouse GE (2005) Meta-RaPS: a simple and effective approach for solving the traveling salesman problem. Transp Res E: Logist Transp Rev 41(2):115–130

    Article  Google Scholar 

  • Duin CW, Van Sluis E (2006) On the complexity of adjacent resource scheduling. J Sched 9:49–62

    Article  Google Scholar 

  • Garcia C (2010) Optimization models and algorithms for spatial scheduling. Ph.D. Thesis, Old Dominion University, Norfolk

    Google Scholar 

  • Garcia C, Rabadi G (2011) A meta-RaPS algorithm for spatial scheduling with release times. Int J Plann Sched 1(1/2):19–31

    Article  Google Scholar 

  • Garcia C, Rabadi G (2013) Exact and approximate methods for parallel multiple-area spatial scheduling with release times. OR Spectr 35(3):639–657

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Lee KJ, Lee JK (1996) A spatial scheduling system and its application to shipbuilding: DAS-curve. Expert Syst Appl 10:311–324

    Article  Google Scholar 

  • Moraga RJ (2002) Meta-RaPS: an effective solution approach for combinatorial problems. Ph.D. thesis, University of Central Florida, Orlando

    Google Scholar 

  • Moraga RJ, DePuy GW, Whitehouse GE (2005) Meta-RaPS approach for the 0–1 multidimensional knapsack problem. Comput Ind Eng 48(2):83–96

    Article  Google Scholar 

  • Padberg M (2000) Packing small boxes into a big box. Math Meth Oper Res 52:1–21

    Article  Google Scholar 

  • Paulus JJ, Hurink J (2006) Adjacent resource scheduling: why spatial resources are so hard to incorporate. Electron Notes Discrete Math 25:113–116

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Srinivasan S (2014) Spatial scheduling algorithms for production planning problems. Ph.D. Thesis, Virginia Commonwealth University, Richmond

    Google Scholar 

  • Varghese R, Yoon, DY (2005) Spatial block arrangement in shipbuilding industry using genetic algorithm for obtaining solution for anticipated bottleneck. Proceedings of the Fifteenth International Offshore and Polar Engineering Conference, vol 4, pp 774–780

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Business, University of Mary Washington, Fredericksburg, VA, 22407, USA

    Christopher Garcia

  2. Department of Engineering Management and Systems Engineering, Old Dominion University, Norfolk, VA, 23529, USA

    Ghaith Rabadi

Authors
  1. Christopher Garcia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ghaith Rabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christopher Garcia .

Editor information

Editors and Affiliations

  1. Engineering Management and Systems Eng., Old Dominion University, NORFOLK, Virginia, USA

    Ghaith Rabadi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Garcia, C., Rabadi, G. (2016). Approximation Algorithms for Spatial Scheduling. In: Rabadi, G. (eds) Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. International Series in Operations Research & Management Science, vol 236. Springer, Cham. https://doi.org/10.1007/978-3-319-26024-2_1

Download citation

Publish with us

Policies and ethics

Search

Navigation