Techniques to effectively buffer schedules in the face of uncertainties

Burdett, Robert L. & Kozan, Erhan (2015) Techniques to effectively buffer schedules in the face of uncertainties. Computers and Industrial Engineering, 87, pp. 16-29.

[img] Accepted Version (PDF 398kB)
Administrators only until September 2018 | Request a copy from author

View at publisher


Resource assignment and scheduling is a difficult task when job processing times are stochastic, and resources are to be used for both known and unknown demand. To operate effectively within such an environment, several novel strategies are investigated. The first focuses upon the creation of a robust schedule, and utilises the concept of strategically placed idle time (i.e. buffering). The second approach introduces the idea of maintaining a number of free resources at each time, and culminates in another form of strategically placed buffering. The attraction of these approaches is that they are easy to grasp conceptually, and mimic what practitioners already do in practice. Our extensive numerical testing has shown that these techniques ensure more prompt job processing, and reduced job cancellations and waiting time. They are effective in the considered setting and could easily be adapted for many real life problems, for instance those in health care. This article has more importantly demonstrated that integrating the two approaches is a better strategy and will provide an effective stochastic scheduling approach.

Impact and interest:

5 citations in Scopus
5 citations in Web of Science®
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 83740
Item Type: Journal Article
Refereed: Yes
Additional URLs:
Keywords: Scheduling, Buffering, Resource Partitioning, Uncertain Demand
DOI: 10.1016/j.cie.2015.04.024
ISSN: 0360-8352
Subjects: Australian and New Zealand Standard Research Classification > MATHEMATICAL SCIENCES (010000) > APPLIED MATHEMATICS (010200) > Operations Research (010206)
Divisions: Current > Schools > School of Mathematical Sciences
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2015 Elsevier
Copyright Statement: Licensed under the Creative Commons Attribution; Non-Commercial; No-Derivatives 4.0 International. DOI: 10.1016/j.cie.2015.04.024
Deposited On: 26 Apr 2015 22:19
Last Modified: 14 Dec 2015 06:15

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page