Authors:
Yuri N. Sotskov
1
;
Natalja G. Egorova
1
;
Tsung-Chyan Lai
2
and
Frank Werner
3
Affiliations:
1
National Academy of Sciences of Belarus, Belarus
;
2
National Taiwan University, Taiwan
;
3
Otto-von-Guericke-Universität Magdeburg, Germany
Keyword(s):
Single-machine scheduling, Uncertain data, Total weighted flow time, Stability analysis.
Related
Ontology
Subjects/Areas/Topics:
Application Domains
;
Artificial Intelligence
;
Construction Engineering and Project Management
;
Electronics Design and Manufacturing
;
Formal Methods
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Planning and Scheduling
;
Simulation and Modeling
;
Symbolic Systems
Abstract:
We consider a single-machine scheduling problem, in which the processing time of a job can take any value from a given segment. The criterion is to minimize the sum of weighted completion times of the n jobs, a weight being associated with a job. For a job permutation, we study the stability box, which is a subset of the stability region. We derive an O(nlogn) algorithm for constructing a job permutation with the largest dimension and volume of a stability box. The efficiency of a permutation with the largest dimension and volume of a stability box is demonstrated via a simulation on a set of randomly generated instances.