In the partially ordered knapsack problem we wish to find a maximum-valued subset of vertices whose total weight does not exceed a given knapsack capacity, and which contains every predecessor of a ...

This article presents a dynamic programming algorithm for scheduling, on a single machine, production of multiple items with time-varying deterministic demands. We formulate the scheduling problem ...