Please use this identifier to cite or link to this item:
Title: Predictive-reactive scheduling on a single resource with uncertain future jobs
Authors: Yang, B
Geunes, J
Keywords: Predictive–reactive scheduling
Uncertainty modeling
Project management and scheduling
Issue Date: 2008
Publisher: Elsevier
Source: European journal of operational research, 2008, v. 189, no. 3, p. 1267-1283 How to cite?
Journal: European journal of operational research 
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 predictive (planned) schedule. In the predictive schedule, the firm must determine the amount of planned idle time for uncertain 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.
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/j.ejor.2006.06.077
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 15, 2017

Page view(s)

Last Week
Last month
Checked on Aug 13, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.