Finding the largest suborder of fixed width

DOI10.1007/BF00420355MaRDI QIDQ687176zbMATH OpenOpenAlexFDO

Authors George Steiner

Publication date 17 October 1993

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00420355

zbMATH Keywords

combinatorial optimizationschedulingpolynomial timeminimum cost network flow problemlargest suborder of fixed width

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Combinatorics of partially ordered sets (06A07)

Recommendations

• scientific article; zbMATH DE number 4027523
• Extending partial suborders
• scientific article; zbMATH DE number 3854829
• Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems
• scientific article; zbMATH DE number 1884457

Cites work

• A decomposition theorem for partially ordered sets
• Minimizing setups in ordered sets of fixed width
• Minimizing the number of tardy jobs in single machine sequencing
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms

Cited in

(7)

• Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
• The just-in-time scheduling problem in a flow-shop scheduling system
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
• scientific article; zbMATH DE number 721906 (Why is no real title available?)
• Algorithms for Necklace Maps
• Just-in-time scheduling with controllable processing times on parallel machines
• Minimizing the number of tardy jobs in single machine sequencing

This page was built for publication: Finding the largest suborder of fixed width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687176)