Project scheduling under time dependent costs -- a branch and bound algorithm

DOI10.1023/A:1016046625583MaRDI QIDQ1610883zbMATHOpenAlexFDO

Authors N. R. Achuthan, A. Hardjawidjaja

Publication date 20 August 2002

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016046625583

zbMATH Keywords

branch and boundproject schedulingproject compression

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• New computational results on the discrete time/cost trade-off problem in project networks
• A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows
• Scheduling of project networks
• Discrete time/cost trade-offs in project scheduling with time-switch constraints
• scientific article; zbMATH DE number 1594562

Cited in

(7)

• An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources
• A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints
• Heuristics for a project management problem with incompatibility and assignment costs
• Project time-cost analysis under generalised precedence relations
• A new approach based on the surrogating method in the project time compression problems
• A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags
• A survey of variants and extensions of the resource-constrained project scheduling problem

This page was built for publication: Project scheduling under time dependent costs -- a branch and bound algorithm

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