Minimizing setups in ordered sets of fixed width
- 1 January 1985
- journal article
- Published by Springer Nature in Order
- Vol. 1 (3) , 225-229
- https://doi.org/10.1007/bf00383598
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Linear Arrangements of Interval OrdersOperations Research Proceedings, 1985
- Jump number of dags having Dilworth number 2Discrete Applied Mathematics, 1984
- Minimizing the jump number for partially ordered sets: A graph-theoretic approachOrder, 1984
- Minimizing setups for cycle-free ordered setsProceedings of the American Mathematical Society, 1982
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978