We start this chapter with providing some basic concepts in deterministic scheduling theory (Section 2.1). In Section 2.2 we introduce the theory of apportionment, developed by Balinski and Young. This theory originated from the problem of finding a fair representation of states in the US House of Representatives. Some methods of apportionment may be also used to solve scheduling problems, especially schedule balancing problems. We present these applications in Chapter 5.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2007). Methodological background. In: Józefowska, J. (eds) Just-In-Time Scheduling: Models and Algorithms for Computer and Manufacturing Systems. International Series In Operations Research amp; Mana, vol 106. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-71718-0_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-71718-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-71717-3
Online ISBN: 978-0-387-71718-0
eBook Packages: EngineeringEngineering (R0)