Simulated Annealing and Tabu Search for Discrete-Continuous Project Scheduling with Discounted Cash Flows
From MaRDI portal
Publication:5410240
DOI10.1051/RO/2013045zbMath1311.90054OpenAlexW1973770523MaRDI QIDQ5410240
Publication date: 16 April 2014
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2014__48_1_1_0/
metaheuristicssimulated annealingtabu searchnonlinear programmingnet present valuediscounted cash flowsdiscrete-continuous project schedulingpayment models
Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates ⋮ On a certain class of power- and energy-related scheduling problems
This page was built for publication: Simulated Annealing and Tabu Search for Discrete-Continuous Project Scheduling with Discounted Cash Flows