Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Authors
- Choi, Byung-Cheon; Chung, Kwanghun
- Issue Date
- Jul-2016
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Scheduling; Uncertainty; Outsourcing; Computational complexity
- Citation
- EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.252, no.2, pp.367 - 375
- Journal Title
- EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Volume
- 252
- Number
- 2
- Start Page
- 367
- End Page
- 375
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/7581
- DOI
- 10.1016/j.ejor.2015.12.046
- ISSN
- 0377-2217
- Abstract
- We consider the min-max regret version of a single-machine scheduling problem to determine which jobs are processed by outsourcing under processing time uncertainty. The performance measure is expressed as the total cost for processing some jobs in-house and outsourcing the rest. Processing time uncertainty is described through two types of scenarios: either an interval scenario or a discrete scenario. The objective is to minimize the maximum deviation from optimality over all scenarios. We show that when the cost for in-house jobs is expressed as the makespan, the problem with an interval scenario is polynomially solvable, while the one with a discrete scenario is NP-hard. Thus, for the discrete scenario case, we develop a 2-approximation algorithm and investigate when the problem is polynomially solvable. Since the problem minimizing the total completion time as a performance measure for in-house jobs is known to be NP-hard for both scenarios, we consider the problem with a special structure for the processing time uncertainty and develop a polynomial-time algorithm for both scenarios. (C) 2016 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Business Administration > Business Administration Major > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/7581)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.