《2016 Predictive–reactive scheduling on a single resource with uncertain future jobs》.pdf

Available online at European Journal of Operational Research 189 (2008) 1267–1283 /locate/ejor Predictive–reactive scheduling on a single resource with uncertain future jobs Bibo Yang a, Joseph Geunes b,* a Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong b Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, United States Received 1 October 2004; accepted 1 June 2006 Available online 24 June 2007 Abstract We consider a scheduling problem where the firm must compete with other firms to win future jobs. Uncertainty arises as a result of incomplete information about whether the firm will win future jobs at the time the firm must create a pre- dictive (planned) schedule. In the predictive schedule, the firm must determine the amount of planned idle time for uncer- tain jobs and their positions in the schedule. When the planned idle time does not match the actual requirements, certain schedule disruptions occur. The firm seeks to minimize the sum of expected tardiness cost, schedule disruption cost, and wasted idle time cost. For the special case of a single uncertain job, we provide a simple algorithm for the optimal planned idle time and the best reactive method for schedule disruptions. For the case of multiple uncertain jobs, a heuristic dynamic programming approach is presented. 2007 Elsevier B.V. All rights reserved. Keywords: Predictive–reactive scheduling; Uncertainty modeling; Project management and scheduling 1. Problem motivation and literatur