Project scheduling with time windows. From theory to applications.

zbMath1058.90027MaRDI QIDQ1890184

Ulrich Dorndorf

Publication date: 22 December 2004

Published in: Contributions to Management Science (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithmconstraint propagationtime windowsresource-constrained project schedulingtime-lagsmulti-modeinterval consistency

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Flight gate assignment and recovery strategies with stochastic arrival and departure times, Project scheduling with finite or infinite number of activity processing modes -- a survey, An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations, A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags, GRASP and path relinking for project scheduling under partially renewable resources, Flight gate scheduling with respect to a reference schedule, Disruption management in flight gate scheduling, A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations, Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models, A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time, Learning heuristics for basic block instruction scheduling, Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound