Partially-ordered knapsack and applications to scheduling

DOI10.1007/3-540-45749-6_54MaRDI QIDQ4411395zbMATH OpenFDO

Authors Stavros G. Kolliopoulos, George Steiner

Publication date 8 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610612.htm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Partially ordered knapsack and applications to scheduling
• A pegging approach to the precedence-constrained knapsack problem
• scientific article; zbMATH DE number 3894817
• scientific article; zbMATH DE number 5605136
• Scheduling partially ordered jobs faster than \(2^n\)

Cited in

(6)

• Single machine precedence constrained scheduling is a Vertex cover problem
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
• Primal-dual algorithms for precedence constrained covering problems
• Primal-dual algorithms for precedence constrained covering problems
• Precedence-constrained covering problems with multiplicity constraints
• Partially ordered knapsack and applications to scheduling

This page was built for publication: Partially-ordered knapsack and applications to scheduling

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