Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Byung-Cheon | - |
dc.contributor.author | Chung, Kwanghun | - |
dc.date.available | 2020-07-10T06:01:10Z | - |
dc.date.created | 2020-07-06 | - |
dc.date.issued | 2016-07 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/7581 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Chung, Kwanghun | - |
dc.identifier.doi | 10.1016/j.ejor.2015.12.046 | - |
dc.identifier.scopusid | 2-s2.0-84959909788 | - |
dc.identifier.wosid | 000372761200002 | - |
dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.252, no.2, pp.367 - 375 | - |
dc.relation.isPartOf | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.title | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.volume | 252 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 367 | - |
dc.citation.endPage | 375 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Business & Economics | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Management | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | COMBINATORIAL OPTIMIZATION PROBLEMS | - |
dc.subject.keywordPlus | 2-MACHINE FLOW-SHOP | - |
dc.subject.keywordPlus | SINGLE-MACHINE | - |
dc.subject.keywordPlus | INTERVAL DATA | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | APPROXIMATION | - |
dc.subject.keywordPlus | COMPLEXITY | - |
dc.subject.keywordPlus | CRITERION | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Uncertainty | - |
dc.subject.keywordAuthor | Outsourcing | - |
dc.subject.keywordAuthor | Computational complexity | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.