Approximation Algorithms for Spatial Scheduling

Christopher Garcia () and Ghaith Rabadi ()
Additional contact information
Christopher Garcia: College of Business, University of Mary Washington
Ghaith Rabadi: Old Dominion University

Chapter Chapter 1 in Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling, 2016, pp 1-16 from Springer

Abstract: 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.

Keywords: Spatial scheduling; Greedy algorithms; Metaheuristics; MetaRaPS (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-26024-2_1

Ordering information: This item can be ordered from
http://www.springer.com/9783319260242

DOI: 10.1007/978-3-319-26024-2_1

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().