This paper examines how setups, due-dates and the mix of standardized and customized products affect the scheduling of a single machine operating in a dynamic and stochastic environment. We restrict ourseh'es to the class of d}'namic cyclic policies, where the machine busy/idle policy and lot-sizing decisions are controlled in a dynamic fashion, but different products must be produced in a fixe...

Abstract We consider the product knapsack problem, which is variant of classical 0-1 problem where objective consists maximizing profits selected items. These are allowed to be positive or negative. present first fully polynomial-time approximation scheme for known weakly -hard. Moreover, we analyze quality achieved by a natural extension greedy procedure problem.

As financial markets are volatile and rapidly changing, preciseness and agility in price evaluation and risk assessment in the portfolios are more important and decision support systems containing diverse financial products and pricing algorithms have been adopted to support those quantitative analysis tasks. To effectively use the financial DSS, the trader should be able to know which algorith...