\(N\)-extendible posets, and how to minimize total weighted completion time
type: Item
instance of: scholarly article
title: \(N\)-extendible posets, and how to minimize total weighted completion time
zbMATH Open document ID: 0954.05045
DOI: 10.1016/S0166-218X(99)00131-6
author: Markus Peter
author: Georg Wambach
published in: Discrete Applied Mathematics
publication date: 2000-11-14T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 1395009
zbMATH Keywords: extendible comparability graphs
zbMATH Keywords: extendible posets
zbMATH Keywords: sparse posets
zbMATH Keywords: single machine scheduling
MaRDI profile type: Publication
cites work: The permutahedron of \(N\)-sparse posets
cites work: On the \(p\)-connectedness of graphs---a survey
cites work: Q5501779
cites work: Interval orders without odd crowns are defect optimal
cites work: P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
cites work: On a unique tree representation for \(P_ 4\)-extendible graphs
cites work: A tree representation for \(P_ 4\)-sparse graphs
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: Q3683903
cites work: Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
cites work: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
Recommended article: The Complexity of the Extendibility Problem for Finite Posets
Recommended article: Minimizing the sum cost in linear extensions of a poset
Recommended article: Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
Recommended article: Q4536382
Recommended article: NP-partitions over posets with an application to reducing the set of solutions of NP problems
Recommended article: On the extension complexity of combinatorial polytopes
Recommended article: Q6059198
Recommended article: Minimizing the sum of weighted completion times with unrestricted weights
Recommended article: Minimizing the maximum bump cost in linear extensions of a poset
description: scientific article; zbMATH DE number 1395009