Skip to main content

Assignment and Location Problems in Supply Chains

  • Chapter
  • 1578 Accesses

Part of the book series: SpringerBriefs in Optimization ((BRIEFSOPTI))

Abstract

This chapter delves into problems that require assigning customer demands to supply sources. When no fixed cost exists for using a supply source and supply sources are capacitated, we have a generalized assignment problem (GAP). When fixed costs are incurred for using a supply source, then the problem is a classical facility location problem (FLP). We consider both capacitated and uncapacitated facility location problems, as well as the implications of requiring single sourcing constraints that do not allow splitting a demand between supply sources. Within these problem classes, we analyze two different forms of demand flexibility. The first type of flexibility corresponds to what we saw in the last two chapters, i.e., each demand must be either fully accepted or rejected. The second type of flexibility requires satisfying each demand, but the quantity (e.g., size, number of units) at which a demand is satisfied must fall between prespecified lower and upper limits, while revenue is proportional to the level at which the demand is satisfied. This chapter defines several such assignment and location models containing these dimensions of demand flexibility.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

References

  1. Balakrishnan A, Geunes J (2003) Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing. Operations Research 51(1):94–112

    Article  MATH  Google Scholar 

  2. Ingargiola G, Korsh J (1975) An Algorithm for the Solution of 0-1 Loading Problems. Operations Research 23(6):1110–1119

    Article  MathSciNet  MATH  Google Scholar 

  3. Merzifonluoğlu Y, Geunes J (2004) Requirements Planning with Order Selection and Demand Timing Flexibility. 2004 Industrial Engineering Research Conference (IERC) Proceedings

    Google Scholar 

  4. Merzifonluoğlu Y, Geunes J (2006) Uncapacitated Production and Location Planning Models with Demand Fulfillment Flexibility. International Journal of Production Economics 102:199–216

    Article  Google Scholar 

  5. Rainwater C, Geunes J, Romeijn H (2008) Capacitated Facility Location with Single-Source Constraints and Flexible Demand. Technical report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida

    Google Scholar 

  6. Rainwater C, Geunes J, Romeijn H (2009) The Generalized Assignment Problem with Flexible Jobs. Discrete Applied Mathematics 157:49–67

    Article  MathSciNet  MATH  Google Scholar 

  7. Rainwater C, Geunes J, Romeijn H (2011) A Facility Neighborhood Search Heuristic for Capacitated Facility Location with Single-Source Constraints and Flexible Demand. Journal of Heuristics (forthcoming)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Joseph Geunes

About this chapter

Cite this chapter

Geunes, J. (2012). Assignment and Location Problems in Supply Chains. In: Demand Flexibility in Supply Chain Planning. SpringerBriefs in Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9347-2_7

Download citation

Publish with us

Policies and ethics