Abstract
In this chapter, we consider a group of methods that are applicable to problems of optimizing functions over a set of all permutations. The correctness of the basic methods is typically proved by the pairwise interchange argument, and the basic methods can be further extended to become applicable to solve more general problems.
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
References
Brucker P (2007) Scheduling algorithms, 5th edn. Guildford, Springer
Bruno JL, Coffman EG Jr, Sethi R (1974) Scheduling independent tasks to reduce mean finishing time. Comm ACM 17:382–387
Conway RW, Maxwell WL, Miller LW (1967) Theory of scheduling. Addison Wesley, Reading (MA)
Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Technol J 45:1563–1581
Hardy G, Littlewood JE, Polya G (1934) Inequalities. Cambridge University Press, London
Kelly FP (1982) A remark on search and sequencing problems. Math Oper Res 7:154–157
Marshall AW, Olkin I (1979) Inequalities: Theory of majorization and its applications. Academic Press, New York
Qian F, Gribkovskaia IV, Halskau Ø (2012) Passenger and pilot risk minimization in offshore helicopter transportation. Omega 40:584–593
Qian F, Strusevich VA, Gribkovskaia IV, Halskau Ø (2015) Minimization of passenger takeoff and landing risk in offshore helicopter transportation: models, approaches and analysis. Omega 51:93–106
Queyranne M (1993) Structure of a simple scheduling polyhedron. Math Progr 58:263–285
Rau JG (1971) Minimizing a function of permutations of \(n\) integers. Oper Res 19:237–240
Rustogi K, Strusevich VA (2012) Simple matching vs linear assignment in scheduling models with positional effects: a critical review. Eur J Oper Res 222:393–407
Rustogi K, Strusevich VA (2013) Parallel machine scheduling: Impact of adding an extra machine. Oper Res 61:1243–1257
Smith WE (1956) Various optimizers for single state production. Naval Res Logist Quart 3:66–69
Townsend W (1978) The single machine problem with quadratic penalty function of completion times: a barnch-and-bound solution. Manag Sci 24:530–533
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Strusevich, V.A., Rustogi, K. (2017). Pairwise Interchange Argument and Priority Rules. In: Scheduling with Time-Changing Effects and Rate-Modifying Activities. International Series in Operations Research & Management Science, vol 243. Springer, Cham. https://doi.org/10.1007/978-3-319-39574-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-39574-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39572-2
Online ISBN: 978-3-319-39574-6
eBook Packages: Business and ManagementBusiness and Management (R0)