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

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

We consider a single machine scheduling problem with uncertain durations of the given jobs. The objective function is minimizing the sum of the job completion times. We apply the stability approach to the considered uncertain scheduling problem using a relative perimeter of the optimality box as a s...

Full description

Bibliographic Details
Main Authors: Yuri N. Sotskov, Natalja G. Egorova
Format: Article
Language:English
Published: MDPI AG 2018-05-01
Series:Algorithms
Subjects:
scheduling
uncertain durations
single machine
total completion time
Online Access:http://www.mdpi.com/1999-4893/11/5/66

Similar Items

Similar Items