Interval Orders

Bernd S. W. Schröder
Additional contact information
Bernd S. W. Schröder: Lousiana Tech University, Program of Mathematics and Statistics

Chapter 8 in Ordered Sets, 2003, pp 185-199 from Springer

Abstract: Abstract Consider the job of scheduling talks at a conference or allocating processor time to several concurrently running programs. These types of problems are what is handled in scheduling theory. The tasks involved each take a certain amount of time. Thus, abstractly, each task can be represented as an interval on the real line. Intervals can be ordered in a natural fashion (for scheduling and otherwise). An interval I is before another interval I’ iff I is completely to the left of I’. This is essentially the idea that two tasks can only be related if one is finished before the other.

Date: 2003
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:sprchp:978-1-4612-0053-6_8

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

DOI: 10.1007/978-1-4612-0053-6_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().