Pairwise Interchange Argument and Priority Rules

Vitaly A. Strusevich () and Kabir Rustogi
Additional contact information
Vitaly A. Strusevich: University of Greenwich
Kabir Rustogi: University of Greenwich

Chapter Chapter 2 in Scheduling with Time-Changing Effects and Rate-Modifying Activities, 2017, pp 19-36 from Springer

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

Keywords: Completion Time; Parallel Machine; Priority Rule; Feasible Schedule; Total Completion Time (search for similar items in EconPapers)
Date: 2017
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-39574-6_2

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

DOI: 10.1007/978-3-319-39574-6_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 ().