Min–max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty

Choi, Byung-Cheon; Chung, Kuang‐Ren

doi:10.1016/j.ejor.2015.12.046

Cited by 21 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The values ( * ) for all ∈ can be obtained in ( 2 ) by the algorithm of Engels et al [7] and Ghosh [8]. The set can be obtained in ( 2 ) by the algorithm of Choi and Chung [6]. Since ( ) can be calculated in ( ) for each ∈ and ∈ , the value ( ) can be calculated in ( ).…”

Section: Polynomialitymentioning

confidence: 99%

“…Furthermore, the deterministic version of the single-machine scheduling problem with an outsourcing option has been extensively studied since Vickson [4] (see Shabtay et al [5] for comprehensive survey). To our best knowledge, the scheduling problem with an outsourcing option under uncertainty for some parameters has only been studied by Choi and Chung [6]. The authors considered the case in which the processing time is uncertain while the outsourcing cost is known.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Single‐Machine Scheduling Problem with Uncertainty in Processing Times and Outsourcing Costs

Park¹,

Choi²

2017

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

We consider a single-machine scheduling problem with an outsourcing option in an environment where the processing time and outsourcing cost are uncertain. The performance measure is the total cost of processing some jobs in-house and outsourcing the rest. The cost of processing in-house jobs is measured as the total weighted completion time, which can be considered the operating cost. The uncertainty is described through either an interval or a discrete scenario. The objective is to minimize the maximum deviation from the optimal cost of each scenario. Since the deterministic version is known to be NP-hard, we focus on two special cases, one in which all jobs have identical weights and the other in which all jobs have identical processing times. We analyze the computational complexity of each case and present the conditions that make them polynomially solvable.

show abstract

Section: Polynomialitymentioning

confidence: 99%