Minimizing setups in ordered sets of fixed width

DOI10.1007/BF00383598MaRDI QIDQ762183zbMATH OpenFDO

Authors William R. Pulleyblank, Charles J. Colbourn

Publication date 1985

Published in Order (Search for Journal in Brave)

zbMATH Keywords

posetspolynomial time algorithmwidthchainslinear extensionDilworth numbersetup number

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15)

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

• scientific article; zbMATH DE number 3896963 (Why is no real title available?)
• scientific article; zbMATH DE number 3924538 (Why is no real title available?)
• Complexity of Scheduling under Precedence Constraints
• Jump number of dags having Dilworth number 2
• 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

Cited in

(29)

• On some new types of greedy chains and greedy linear extensions of partially ordered sets
• The setup polytope of \(N\)-sparse posets
• Finding the largest suborder of fixed width
• On 2min-sets and 2minmax-sets with respect to certain cycles
• Algorithms for Necklace Maps
• A setup heuristic for interval orders
• An algorithm for solving the jump number problem
• scientific article; zbMATH DE number 59573 (Why is no real title available?)
• Jump number problem: The role of matroids
• scientific article; zbMATH DE number 4027523 (Why is no real title available?)
• A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
• Minimizing bumps in linear extensions of ordered sets
• Greedy posets for the bump-minimizing problem
• An improved algorithm for the jump number problem
• Scheduling tasks on a flexible manufacturing machine to minimize tool change delays
• Algorithmic Approaches to Setup Minimization
• Approximation of the double traveling salesman problem with multiple stacks
• Constrained TSP and low-power computing
• Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
• Minimizing bumps for posets of width two
• Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
• The arboreal jump number of an order
• Order Reconfiguration Under Width Constraints.
• On a setup optimization problem for interval orders
• A linear-time parameterized algorithm for computing the width of a DAG
• Greedy balanced pairs in \(N\)-free ordered sets
• On minimizing jumps for ordered sets
• Scheduling of resource tasks
• The jump number of Z-free ordered sets

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)