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

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 meas...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2017-01, Vol.2017 (2017), p.1-8
Main Authors: Park, Myoung-Ju, Choi, Byung-Cheon
Format: Article
Language:English
Subjects:
Completion time
Cost analysis
Costs
Deviation
Job shops
Operating costs
Optimization
Outsourcing
Production scheduling
Scheduling
Time measurement
Uncertainty
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1024-123X
1563-5147
DOI:10.1155/2017/5791796