Minimizing setups in ordered sets of fixed width
From MaRDI portal
Publication:762183
DOI10.1007/BF00383598zbMath0557.06002MaRDI QIDQ762183
William R. Pulleyblank, Charles J. Colbourn
Publication date: 1985
Published in: Order (Search for Journal in Brave)
Related Items
Minimizing bumps in linear extensions of ordered sets ⋮ A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders ⋮ On some new types of greedy chains and greedy linear extensions of partially ordered sets ⋮ Greedy posets for the bump-minimizing problem ⋮ Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II ⋮ An algorithm for solving the jump number problem ⋮ Minimizing bumps for posets of width two ⋮ A linear-time parameterized algorithm for computing the width of a DAG ⋮ Constrained TSP and low-power computing ⋮ Algorithms for Necklace Maps ⋮ The arboreal jump number of an order ⋮ Greedy balanced pairs in \(N\)-free ordered sets ⋮ On minimizing jumps for ordered sets ⋮ The jump number of Z-free ordered sets ⋮ On a setup optimization problem for interval orders ⋮ Finding the largest suborder of fixed width ⋮ Scheduling tasks on a flexible manufacturing machine to minimize tool change delays ⋮ Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings ⋮ Approximation of the double traveling salesman problem with multiple stacks ⋮ Scheduling of resource tasks ⋮ Jump number problem: The role of matroids ⋮ An improved algorithm for the jump number problem
Cites Work
- Unnamed Item
- Unnamed Item
- Jump number of dags having Dilworth number 2
- Minimizing completion time for a class of scheduling problems
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Minimizing Setups for Cycle-Free Ordered Sets
- Complexity of Scheduling under Precedence Constraints
This page was built for publication: Minimizing setups in ordered sets of fixed width
