scholarly journals Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

2015 ◽  
Vol 2015 ◽  
pp. 1-5 ◽  
Author(s):  
Ting Wang ◽  
Dehua Xu
Keyword(s):  
Single Machine ◽  
Time Window ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maximum Lateness ◽  
Scheduling Problem ◽  
Due Date ◽  
Start Time ◽  
Tight Bound ◽  
Special Cases

A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered. The start time of the maintenance is restricted to a time window. The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized. An approximation algorithm based on the classical Earliest Due Date first rule is proposed. It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.

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