An efficient time-windowing procedure for scheduling projects under multiple resource constraints

DOI10.1007/s00291-003-0158-yzbMath1109.90048OpenAlexW2085775085MaRDI QIDQ1881629

M. Reza Zamani

Publication date: 5 October 2004

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-003-0158-y

zbMATH Keywords

Project managementSchedulingBranch-and-boundMeta-heuristic

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Towards merging binary integer programming techniques with genetic algorithms

Uses Software

• PSPLIB

This page was built for publication: An efficient time-windowing procedure for scheduling projects under multiple resource constraints