scholarly journals Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective

Algorithms ◽  
2018 ◽  
Vol 11 (5) ◽  
pp. 66 ◽  
Author(s):  
Yuri Sotskov ◽  
Natalja Egorova
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Total Completion Time ◽  
Scheduling Problem ◽  
Processing Times ◽  
Interval Processing Times

scholarly journals The Optimality Region for a Single-Machine Scheduling Problem with Bounded Durations of the Jobs and the Total Completion Time Objective

Mathematics ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 382 ◽  
Author(s):  
Yuri N. Sotskov ◽  
Natalja G. Egorova
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Optimal Schedule ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Total Completion Time ◽  
Scheduling Problem ◽  
Lower And Upper Bounds ◽  
The Given ◽  
Optimality Region

We study a single-machine scheduling problem to minimize the total completion time of the given set of jobs, which have to be processed without job preemptions. The lower and upper bounds on the job duration is the only information that is available before scheduling. Exact values of the job durations remain unknown until the completion of the jobs. We use the optimality region for the job permutation as an optimality measure of the optimal schedule. We investigate properties of the optimality region and derive O ( n ) -algorithm for calculating a quasi-perimeter of the optimality set (i.e., the sum of lengths of the optimality segments for n given jobs). We develop a fast algorithm for finding a job permutation having the largest quasi-perimeter of the optimality set. The computational results in constructing such permutations show that they are close to the optimal ones, which can be constructed for the factual durations of all given jobs.

Sign in / Sign up

Export Citation Format

Share Document