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

Brian Keller and GÜzİn Bayraksan

IISE Transactions, 2010, vol. 42, issue 1, 16-30

Abstract: A two-stage stochastic integer program to determine an optimal schedule for jobs requiring multiple classes of resources under uncertain processing times, due dates, resource consumption and availabilities is formulated. Temporary resource capacity expansion for a penalty is allowed. Potential applications of this model include team scheduling problems that arise in service industries such as engineering consulting and operating room scheduling. An exact solution method is developed based on Benders decomposition for problems with a moderate number of scenarios. Benders decomposition is then embedded within a sampling-based solution method for problems with a large number of scenarios. A sequential sampling procedure is modified to allow for approximate solution of integer programs and its asymptotic validity and finite stopping are proved under this modification. The solution methodologies are compared on a set of test problems. Several algorithmic enhancements are added to improve efficiency.

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1080/07408170902942683 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:42:y:2010:i:1:p:16-30

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/07408170902942683

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().