Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return

DOI10.1287/MNSC.38.5.751MaRDI QIDQ4018318zbMATH OpenOpenAlexFDO

Authors Sushil K. Gupta, Jerzy Kyparisis, Chi 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

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cited in

(9)

• Project selection with discounted returns and multiple constraints
• Job selection and sequencing on a single machine in a random environment
• Selecting jobs for scheduling on a machine subject to failure
• Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline
• Permutation flow shop scheduling with order acceptance and weighted tardiness
• Greedy solutions of selection and ordering problems
• 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
• A parallel computing approach for scheduling Markovian project networks to maximize the expected net present value

This page was built for publication: Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return

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