NONPREEMPTIVE MULTIMODE RESOURCE-CONSTRAINED PROJECT SCHEDULING

This paper addresses methods for formulating and solving a general cla ss of nonpreemptive resource-constrained project scheduling problems i n which job durations are discrete functions of committed renewable, n onrenewable and doubly-constrained resources (multi-mode time resource tradeoff). We present a stochastic scheduling method which solves the se problems to suboptimality in an efficient way. Computational result s demonstrate that this method is highly superior to other well-known existing deterministic scheduling rules. Extensions to problems in whi ch job-specific (demand) resource profiles are varying with time, in a ddition to time-varying supply resource profiles, are discussed as wel l.