Next Article in Journal
Automated Processing of fNIRS Data—A Visual Guide to the Pitfalls and Consequences
Next Article in Special Issue
Hybrid Flow Shop with Unrelated Machines, Setup Time, and Work in Progress Buffers for Bi-Objective Optimization of Tortilla Manufacturing
Previous Article in Journal
Control Strategy of Speed Servo Systems Based on Deep Reinforcement Learning
Previous Article in Special Issue
Optimal Control Algorithms and Their Analysis for Short-Term Scheduling in Manufacturing Systems
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(5), 66; https://doi.org/10.3390/a11050066

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

United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova Street 6, Minsk 220012, Belarus
*
Author to whom correspondence should be addressed.
Received: 2 March 2018 / Revised: 14 April 2018 / Accepted: 23 April 2018 / Published: 7 May 2018
(This article belongs to the Special Issue Algorithms for Scheduling Problems)
View Full-Text   |   Download PDF [358 KB, uploaded 7 May 2018]   |  

Abstract

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 stability measure of the optimal job permutation. We investigated properties of the optimality box and developed algorithms for constructing job permutations that have the largest relative perimeters of the optimality box. Computational results for constructing such permutations showed that they provided the average error less than 0 . 74 % for the solved uncertain problems. View Full-Text
Keywords: scheduling; uncertain durations; single machine; total completion time scheduling; uncertain durations; single machine; total completion time
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Sotskov, Y.N.; Egorova, N.G. Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective. Algorithms 2018, 11, 66.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top