Scheduling jobs sharing multiple resources under uncertainty: A stochastic programming approach

References

• Aytug , H. , Lawley , M. , McKay , K. , Mohan , S. and Uzsoy , R. 2005 . Executing production schedules in the face of uncertainties: a review and some future directions . European Journal of Operational Research , 161 : 86 – 110 .
   Web of Science ®Google Scholar
• Baker , K. and Trietsch , D. 2007 . “ Safe scheduling ” . In Tutorials in Operations Research , 79 – 101 . Hanover, MD : INFORMS .
   Google Scholar
• Bayraksan , G. and Morton , D. 2006 . Assessing solution quality in stochastic programs . Mathematical Programming , 108 : 495 – 514 .
   Web of Science ®Google Scholar
• Bayraksan , G. and Morton , D. 2009 . A sequential sampling procedure for stochastic programming . Operations Research , forthcoming
   Web of Science ®Google Scholar
• Benders , J. 1962 . Partitioning procedures for solving mixed-variable programming problems . Numerische Mathematik , 4 : 238 – 252 .
   Google Scholar
• Birge , J. and Dempster , M. 1996 . Stochastic programming approaches to stochastic scheduling . Journal of Global Optimization , 9 ( 3–4 ) : 417 – 451 .
   Web of Science ®Google Scholar
• Birge , J. and Louveaux , F. 1997 . Introduction to Stochastic Programming , New York, NY : Springer .
   Google Scholar
• Brucker , P. 2001 . Scheduling Algorithms, , third edition , New York, NY : Springer .
   Google Scholar
• Cai , X. , Lee , C. and Li , C. 1998 . Minimizing total completion time in two-processor task systems with prespecified processor allocations . Naval Research Logistics , 45 : 231 – 242 .
   Web of Science ®Google Scholar
• Chan , L. , Muriel , A. and Simchi-Levi , D. 1998 . Parallel machine scheduling, linear programming, and parameter list scheduling heuristics . Operations Research , 46 : 729 – 741 .
   Web of Science ®Google Scholar
• Chen , J. and Lee , C. 1999 . General multiprocessor task scheduling . Naval Research Logistics , 46 : 57 – 74 .
   Web of Science ®Google Scholar
• Cooper , D. 1976 . Heuristics for scheduling resource constrained projects: An experimental comparison . Management Science , 22 : 1186 – 1194 .
   Web of Science ®Google Scholar
• Deblaere , F. , Demeulemeester , E. , Herroelen , W. and Van de Vonder , S. 2007 . Robust resource allocation decisions in resource-constrained projects . Decision Sciences , 38 : 5 – 37 .
   Web of Science ®Google Scholar
• Denton , B. and Gupta , D. 2003 . A sequential bounding approach for optimal appointment scheduling . IIE Transactions , 35 : 1003 – 1016 .
   Web of Science ®Google Scholar
• Drozdowski , M. 1996 . Scheduling multiprocessor tasks—an overview . European Journal of Operational Research , 94 : 215 – 230 .
   Web of Science ®Google Scholar
• Dyer , M. and Wolsey , L. 1990 . Formulating the single machine sequencing problem with release dates as a mixed integer program . Discrete Applied Mathematics , 26 : 255 – 270 .
   Web of Science ®Google Scholar
• Herroelen , W. 2007 . “ Generating robust project baseline schedules ” . In Tutorials in Operations Research , 124 – 144 . Hanover, MD : INFORMS .
   Google Scholar
• Herroelen , W. and Leus , R. 2005 . Project scheduling under uncertainty: Survey and research potentials . European Journal of Operational Research , 165 : 289 – 306 .
   Web of Science ®Google Scholar
• Herroelen , W. and Reyck , B. D. 1999 . Phase transitions in project scheduling . Journal of the Operational Research Society , 50 : 148 – 156 .
   Web of Science ®Google Scholar
• Herroelen , W. , Reyck , B. D. and Demeulemeester , E. 1998 . Resource-constrained project scheduling: a survey of recent developments . Computers & Operations Research , 25 ( 4 ) : 279 – 302 .
   Web of Science ®Google Scholar
• Higle , J. and Sen , S. 1996 . Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming , Dordrecht, , The Netherlands : Kluwer .
   Google Scholar
• Hiriart-Urruty , J. and Lemaréchal , C. 1993 . Convex Analysis and Minimization Algorithms II. Comprehensive Studies in Mathematics , Berlin : Springer-Verlag .
   Google Scholar
• Hoogeveen , J. , Van de Velde , S. and Veltman , B. 1994 . Complexity of scheduling multiprocessor tasks with prespecified processor allocations . Discrete Applied Mathematics , 55 : 259 – 272 .
   Web of Science ®Google Scholar
• Kiwiel , K. 1990 . Proximity control in bundle methods for convex nondifferentiable minimization . Mathematical Programming , 46 : 105 – 122 .
   Web of Science ®Google Scholar
• Kleywegt , A. , Shapiro , A. and Homem-De-Mello , T. 2001 . The sample average approximation method for stochastic discrete optimization . SIAM Journal of Optimization , 12 : 479 – 502 .
   Web of Science ®Google Scholar
• Kubale , M. 1987 . The complexity of scheduling independent two-processor tasks on dedicated processors . Informations Processing Letters , 24 : 141 – 147 .
   Web of Science ®Google Scholar
• Lee , C. and Cai , X. 1999 . Scheduling one and two-processor tasks on two parallel processors . IIE Transactions , 31 : 445 – 455 .
   Web of Science ®Google Scholar
• Leus , R. and Herroelen , W. 2004 . Stability and resource allocation in project planning . IIE Transactions , 36 : 667 – 682 .
   Web of Science ®Google Scholar
• Linderoth , J. and Wright , S. 2003 . Decomposition algorithms for stochastic programming on a computational grid . Computational Optimization and Applications , 24 : 207 – 250 .
   Web of Science ®Google Scholar
• Marchand , H. and Wolsey , L. 1999 . The 0-1 knapsack problem with a single continuous variable . Mathematical Programming , 85 : 15 – 33 .
   Web of Science ®Google Scholar
• Miller , A. , Nemhauser , G. and Savelsbergh , M. 2000 . On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra . European Journal of Operational Research , 125 : 298 – 315 .
   Web of Science ®Google Scholar
• Möhring , R. , Schultz , A. , Stork , F. and Uetz , M. 2001 . On project scheduling with irregular starting time costs . Operations Research Letters , 28 : 149 – 154 .
   Web of Science ®Google Scholar
• Möhring , R. , Schultz , A. , Stork , F. and Uetz , M. 2003 . Solving project scheduling problems by minimum cut computations . Management Science , 49 : 330 – 350 .
   Web of Science ®Google Scholar
• Morton , D. and Popova , E. 2004 . A Bayesian stochastic programming approach to an employee scheduling problem . IIE Transactions , 36 : 155 – 167 .
   Web of Science ®Google Scholar
• Pascoe , T. 1966 . Allocation of resources—CPM . Revue Française de Recherche Opérationnelle , 38 : 31 – 38 .
   Google Scholar
• Patterson , J. 1976 . Project scheduling: the effects of problem structure on heuristic performance . Naval Research Logistics , 23 : 95 – 123 .
   Web of Science ®Google Scholar
• Queyranne , M. and Schulz , A. 1994 . Polyhedral approaches to machine scheduling , Berlin, , Germany : Department of Mathematics, Technical University of Berlin . Preprint 408/1994
   Google Scholar
• Ruszczyński , A. 1986 . A regularized decomposition method for minimizing a sum of polyhedral functions . Mathematical Programming , 35 : 309 – 333 .
   Web of Science ®Google Scholar
• Santoso , T. , Ahmed , S. , Goetschalckx , M. and Shapiro , A. 2005 . A stochastic programming approach for supply chain network design under uncertainty . European Journal of Operational Research , 167 : 96 – 115 .
   Web of Science ®Google Scholar
• Shapiro , A. 2003 . “ Monte Carlo sampling methods ” . In Handbooks in Operations Research and Management Science, Volume 10: Stochastic Programming , Edited by: Ruszczyński , A. and Shapiro , A. 353 – 425 . Amsterdam : Elsevier .
   Google Scholar
• Van , d e and Vonder , S. 2006 . Proactive-reactive procedures for robust project scheduling , Ph.D. thesis Leuven, , Belgium : Department of Decision Sciences and Information Management, Katholieke Universiteit Leuven .
   Google Scholar
• Van , d e , Vonder , S. , Demeulemeester , E. and Herroelen , W. 2007 . A classification of predictive-reactive project scheduling procedures . Journal of Scheduling , 10 : 195 – 207 .
   Web of Science ®Google Scholar
• Van Slyke , R. and Wets , R. 1969 . L-shaped linear programs with applications to optimal control and stochastic programming . SIAM Journal of Applied Mathematics , 17 : 638 – 663 .
   Web of Science ®Google Scholar
• Wolsey , L. 1990 . Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints . Discrete Applied Mathematics , 29 : 251 – 261 .
   Web of Science ®Google Scholar
• Wolsey , L. 1998 . Integer Programming , New York, NY : Wiley .
   Google Scholar
• Zhu , G. , Bard , J. and Yu , G. 2007 . A two-stage stochastic programming approach for project planning with uncertain activity durations . Journal of Scheduling , 10 : 167 – 180 .
   Web of Science ®Google Scholar