#### Filter Results:

#### Publication Year

2011

2013

#### Key Phrase

#### Publication Venue

Learn More

– The problems of scheduling jobs on a single machine subject to precedence constraints can often be modelled as the jump number problem for posets, where a linear extension of a given partial order is to be found which minimizes the number of noncomparabilities. In this paper, we are investigating a restricted class of posets, called interval orders,… (More)

- ‹
- 1
- ›