IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-319-26024-2_1.html
   My bibliography  Save this book chapter

Approximation Algorithms for Spatial Scheduling

In: Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling

Author

Listed:
  • Christopher Garcia

    (College of Business, University of Mary Washington)

  • Ghaith Rabadi

    (Old Dominion University)

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.

Suggested Citation

  • Christopher Garcia & Ghaith Rabadi, 2016. "Approximation Algorithms for Spatial Scheduling," International Series in Operations Research & Management Science, in: Ghaith Rabadi (ed.), Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling, edition 1, chapter 0, pages 1-16, Springer.
    • Handle: RePEc:spr:isochp:978-3-319-26024-2_1
    DOI: 10.1007/978-3-319-26024-2_1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-3-319-26024-2_1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.