Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
From MaRDI portal
Publication:4018318
DOI10.1287/mnsc.38.5.751zbMath0825.90547OpenAlexW2020916375MaRDI QIDQ4018318
Jerzy Kyparisis, Sushil K. Gupta, Chi-Ming Ip
Publication date: 16 January 1993
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.38.5.751
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (8)
Selecting jobs for scheduling on a machine subject to failure ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment ⋮ Greedy solutions of selection and ordering problems ⋮ Project selection with discounted returns and multiple constraints ⋮ Job selection and sequencing on a single machine in a random environment
This page was built for publication: Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
