scholarly journals A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times

2010 ◽  
Vol 6 (2) ◽  
pp. 269-282 ◽  
Author(s):  
Jiping Tao ◽  
◽  
Zhijun Chao ◽  
Yugeng Xi
Keyword(s):  
Single Machine ◽  
Competitive Analysis ◽  
Online Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Processing Times ◽  
Bounded Processing Times

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

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Myoung-Ju Park ◽  
Byung-Cheon Choi
Keyword(s):  
Single Machine ◽  
Operating Cost ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Performance Measure ◽  
Total Weighted Completion Time ◽  
Maximum Deviation ◽  
Scheduling Problem ◽  
Processing Times ◽  
Special Cases

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.

Sign in / Sign up

Export Citation Format

Share Document