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

DOI10.1023/A:1016046625583zbMath0993.90056OpenAlexW163276831MaRDI QIDQ1610883

A. Hardjawidjaja, N. R. Achuthan

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

project schedulingbranch and boundproject compression

Mathematics Subject Classification ID

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

Related Items (4)

A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints ⋮ An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources ⋮ 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