Robust scheduling on a single machine using time buffers

Dirk Briskorn, Joseph Leung and Michael Pinedo

IISE Transactions, 2011, vol. 43, issue 6, 383-398

Abstract: This article studies the scheduling of buffer times in a single-machine environment. A buffer time is a machine idle time in between two consecutive jobs and is a common tool to protect a schedule against disruptions such as machine failures. This article introduces new classes of robust machine scheduling problems. For an arbitrary non-preemptive scheduling problem 1|β|γ, three corresponding robustness problems are obtained: (i) maximize overall (weighted) buffer time while ensuring a given schedule's performance (with regard to the objective function γ); (ii) optimize the schedule's performance (with regard to γ) while ensuring a given minimum overall (weighted) buffer time; and (iii) find the trade-off curve regarding both objectives. The relationships between the different classes of problems and the corresponding underlying problems are outlined. Furthermore, the robust counterparts of three very basic single-machine scheduling problems are analyzed.

Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2010.505123 (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:43:y:2011:i:6:p:383-398

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

DOI: 10.1080/0740817X.2010.505123

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 ().