Solution Methods for Supply Chain Scheduling Problems

Zhi-Long Chen and Nicholas G. Hall
Additional contact information
Zhi-Long Chen: University of Maryland
Nicholas G. Hall: Ohio State University

Chapter Chapter 2 in Supply Chain Scheduling, 2022, pp 23-49 from Springer

Abstract: Abstract In this chapter we describe some common elements shared by all scheduling problems, introduce some basic concepts related to computational tractability of a problem, and summarize several commonly used solution methods for solving supply chain scheduling problems. These solution methods include dynamic programming, branch-and-bound, integer programming, and approximation procedures. We also provide a brief introduction to both cooperative game theory and noncooperative game theory, which are often used to model decentralized supply chain scheduling problems. Several classical scheduling problems and supply chain scheduling problems are used as examples to illustrate the concepts and solution methods presented.

Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (3)

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-030-90374-9_2

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

DOI: 10.1007/978-3-030-90374-9_2

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 ().