Scheduling projects to maximize net present value — the case of time-dependent, contingent cash flows-Reference-Cited by-同舟云学术

Scheduling projects to maximize net present value — the case of time-dependent, contingent cash flows

Published:1997-01 Issue:1 Volume:96 Page:90-96
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Etgar Ran,Shtub Avraham,LeBlanc Larry J.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference21 articles.

1. Simulated Annealing and Boltzmann Machines;Aarts,1989

2. Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms;Abramson;Management Science,1991

3. An Operation Portioning Problem for Automated Assembly System Design;Ahmade;Operations Research,1991

4. A Practical Approach to the Apparel Production and Scheduling Problem;Chen;Journal of Clothing Science and Technology,1992

5. Linear Programming and Extensions;Dantzig,1963

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Selection of Optimal Technologies for Production of Goods: Space-System Approach;Management and Production Engineering Review;2024-06-30

2. Managing the Balance Between Project Value and Net Present Value Using Reinforcement Learning;IEEE Access;2024

3. Simulated annealing for centralised resource-constrained multiproject scheduling to minimise the maximal cash flow gap under different payment patterns;Annals of Operations Research;2023-09-28

4. Balancing Project Schedule, Cost, and Value under Uncertainty: A Reinforcement Learning Approach;Algorithms;2023-08-21

5. Monte carlo within simulated annealing for integral constrained optimizations;Annals of Operations Research;2022-09-30