Minimizing setups in ordered sets of fixed width
From MaRDI portal
Publication:762183
DOI10.1007/BF00383598zbMATH Open0557.06002MaRDI QIDQ762183FDOQ762183
Authors: William R. Pulleyblank, Charles J. Colbourn 
Publication date: 1985
Published in: Order (Search for Journal in Brave)
Recommendations
- On linear sets of minimum size
- Minimum \(d\)-dimensional arrangement with fixed points
- Minimal separating sets of maximum size
- On minimizing jumps for ordered sets
- Minimizing bumps for posets of width two
- scientific article; zbMATH DE number 91040
- Minimum linear arrangements
- Decorous lower bounds for minimum linear arrangement
- scientific article; zbMATH DE number 1877013
- scientific article; zbMATH DE number 1537567
Cites Work
- Title not available (Why is that?)
- Complexity of Scheduling under Precedence Constraints
- Minimizing Setups for Cycle-Free Ordered Sets
- Minimizing completion time for a class of scheduling problems
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Title not available (Why is that?)
- Jump number of dags having Dilworth number 2
Cited In (29)
- Approximation of the double traveling salesman problem with multiple stacks
- Greedy balanced pairs in \(N\)-free ordered sets
- The setup polytope of \(N\)-sparse posets
- Minimizing bumps in linear extensions of ordered sets
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
- An algorithm for solving the jump number problem
- On some new types of greedy chains and greedy linear extensions of partially ordered sets
- Finding the largest suborder of fixed width
- An improved algorithm for the jump number problem
- On a setup optimization problem for interval orders
- On 2min-sets and 2minmax-sets with respect to certain cycles
- Algorithms for Necklace Maps
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays
- Order Reconfiguration Under Width Constraints.
- The arboreal jump number of an order
- A linear-time parameterized algorithm for computing the width of a DAG
- Minimizing bumps for posets of width two
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- Greedy posets for the bump-minimizing problem
- Constrained TSP and low-power computing
- On minimizing jumps for ordered sets
- The jump number of Z-free ordered sets
- Title not available (Why is that?)
- A setup heuristic for interval orders
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
- Jump number problem: The role of matroids
- Title not available (Why is that?)
- Scheduling of resource tasks
- Algorithmic Approaches to Setup Minimization
This page was built for publication: Minimizing setups in ordered sets of fixed width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762183)
