Minimizing Total Weighted Completion Time on a Single Machine Scheduling Problem with Resumable Jobs and Flexible Maintenance

2018 ◽  
Author(s):  
Ya-Chih Tsai ◽  
Yarong Chen ◽  
Fuh-Der Chou
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Total Weighted Completion Time ◽  
Scheduling Problem ◽  
Weighted Completion Time

Single Machine Two-Agent Scheduling with Deteriorating Jobs

2016 ◽  
Vol 33 (05) ◽  
pp. 1650034 ◽  
Author(s):  
Zhenyou Wang ◽  
Cai-Min Wei ◽  
Yu-Bin Wu
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Processing Time ◽  
Deteriorating Jobs ◽  
Single Machine Scheduling ◽  
Total Weighted Completion Time ◽  
Scheduling Problem ◽  
Agent Scheduling ◽  
Polynomially Solvable ◽  
Weighted Completion Time

This paper deals with the single machine scheduling problem with deteriorating jobs in which there are two distinct families of jobs (i.e., two-agent) pursuing different objectives. In this model the processing time of a job is defined as a function that is proportional to a linear function of its stating time. For the following three scheduling criteria: minimizing the makespan, minimizing the total weighted completion time, and minimizing the maximum lateness, we show that some basic versions of the problem are polynomially solvable. We also establish the conditions under which the problem is computationally hard.

Sign in / Sign up

Export Citation Format

Share Document