toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
  Record Links
Author Pereira, J. pdf  doi
  Title The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective Type
  Year 2016 Publication Computers & Operations Research Abbreviated Journal Comput. Oper. Res.  
  Volume 66 Issue Pages 141-152  
  Keywords Scheduling; Single machine; Uncertainty; Robust optimization; Branch-and-bound  
  Abstract Single machine scheduling is a classical optimization problem that depicts multiple real life systems in which a single resource (the machine) represents the whole system or the bottleneck operation of the system. In this paper we consider the problem under a weighted completion time performance metric in which the processing time of the tasks to perform (the jobs) are uncertain, but can only take values from closed intervals. The objective is then to find a solution that minimizes the maximum absolute regret for any possible realization of the processing times. We present an exact branch-and-bound method to solve the problem, and conduct a computational experiment to ascertain the possibilities and limitations of the proposed method. The results show that the algorithm is able to optimally solve instances of moderate size (25-40 jobs depending on the characteristics of the instance). (c) 2015 Elsevier Ltd. All rights reserved.  
  Address [Pereira, Jordi] Univ Adolfo Ibanez, Fac Sci & Engn, Vina Del Mar, Chile, Email:  
  Corporate Author Thesis  
  Publisher Pergamon-Elsevier Science Ltd Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title (up) Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0305-0548 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000366779900013 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 558  
Permanent link to this record
Select All    Deselect All
 |   | 

Save Citations:
Export Records: