A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags

From MaRDI portal
Publication:1869389

DOI10.1016/S0377-2217(02)00136-4zbMath1012.90513MaRDI QIDQ1869389

Roland Heilmann

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)




Related Items (22)

On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relationsScheduling under the network of temporo-spatial proximity relationshipsModelling and solving generalised operational surgery scheduling problemsA branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lagsA polyhedral study of event-based models for the resource-constrained project scheduling problemProject scheduling with finite or infinite number of activity processing modes -- a surveyA branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer timesProperties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splittingTime and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centresA modified PSO algorithm for minimizing the total costs of resources in MRCPSPA min-flow algorithm for minimal critical set detection in resource constrained project schedulingMathematical model for cyclic scheduling with work-in-process minimizationA mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lagsConsidering project management activities for engineering design groupsA practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lagsSkilled workforce scheduling in service centresA PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMSA double genetic algorithm for the MRCPSP/maxReactive scheduling in the multi-mode RCPSPA survey of variants and extensions of the resource-constrained project scheduling problemA modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splittingProject selection, scheduling and resource allocation with time dependent returns



Cites Work




This page was built for publication: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags