Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147557
Authors: 
Briskorn, Dirk
Leung, Joseph
Pinedo, Michael
Year of Publication: 
2008
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 639
Abstract: 
This paper studies the allocation of buffer times in a single machine environment. Buffer times are a common tool to protect the schedule against disruptions such as machine failures. We introduce new classes of robust machine scheduling problems. For an arbitrary scheduling problem 1, prmt ∉ ß, we obtain three corresponding robust problems: maximize overall (weighted) buffer time while ensuring a given schedule's performance (regarding y), optimize the schedule's performance (regarding y) while ensuring a given minimum overall (weighted) buffer time, and finding the trade off curve regarding both objectives. We outline the relationships between the different classes of problems and the corresponding underlying problem. Furthermore, we analyze the robust counterparts of three fundamental problems.
Subjects: 
Single machine scheduling
robustness
buffer time allocation
Document Type: 
Working Paper

Files in This Item:
File
Size





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