\(N\)-extendible posets, and how to minimize total weighted completion time

DOI10.1016/S0166-218X(99)00131-6zbMath0954.05045MaRDI QIDQ1962041

Georg Wambach, Markus Peter

Publication date: 14 November 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

single machine schedulingextendible comparability graphsextendible posetssparse posets

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Cross-series-parallel digraphs

Cites Work

• Interval orders without odd crowns are defect optimal
• On a unique tree representation for \(P_ 4\)-extendible graphs
• A tree representation for \(P_ 4\)-sparse graphs
• On the \(p\)-connectedness of graphs---a survey
• The permutahedron of \(N\)-sparse posets
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Unnamed Item
• Unnamed Item

This page was built for publication: \(N\)-extendible posets, and how to minimize total weighted completion time