Minimizing setups in ordered sets of fixed width

Charles J. Colbourn, William R. Pulleyblank

Research output: Contribution to journalArticlepeer-review

33 Scopus citations


A simply polynomial time algorithm is given for computing the setup number, or jump number, of an ordered set with fixed width. This arises as an interesting application of a polynomial time algorithm for solving a more general weighted problem in precedence constrained scheduling.

Original languageEnglish (US)
Pages (from-to)225-229
Number of pages5
Issue number3
StatePublished - Sep 1985
Externally publishedYes


  • AMS (MOS) subject classifications (1980): Primary 06A10, secondary 05C99, 68E99
  • dynamic programming
  • jump number
  • ordered set
  • polynomial time algorithm
  • setup number
  • width

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Geometry and Topology
  • Computational Theory and Mathematics


Dive into the research topics of 'Minimizing setups in ordered sets of fixed width'. Together they form a unique fingerprint.

Cite this