Finding the largest suborder of fixed width

DOI10.1007/BF00420355zbMath0781.06006OpenAlexW2010610650MaRDI QIDQ687176

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

schedulingcombinatorial optimizationpolynomial timeminimum cost network flow problemlargest suborder of fixed width

Mathematics Subject Classification ID

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

Related Items (6)

Algorithms for Necklace Maps ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ The just-in-time scheduling problem in a flow-shop scheduling system ⋮ Minimizing the number of tardy jobs in single machine sequencing ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ Minimizing the number of tardy jobs with precedence constraints and agreeable due dates

Cites Work

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

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