The poset scheduling problem
Journal
Order
Journal Volume
2
Journal Issue
2
Pages
113-118
Date Issued
1985
Author(s)
Abstract
Let P and Q be two finite posets and for each p∈P and q∈Q let c(p, q) be a specified (real-valued) cost. The poset scheduling problem is to find a function s: P→Q such that Σp∈Pc(p, s(p)) is minimized, subject to the constraints that p
Type
journal article