Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems

In this paper, we study a robust single-machine scheduling problem under four alternative optimization criteria: minimizing total completion time, minimizing total weighted completion time, minimizing maximum lateness, and minimizing the number of late jobs. We assume that job processing times are s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scheduling Ročník 18; číslo 6; s. 575 - 592
Hlavní autoři: Tadayon, Bita, Smith, J. Cole
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.12.2015
Springer Nature B.V
Témata:
Algorithms
Analysis
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Completion time
Complexity theory
Criteria
Dynamic programming
Integer programming
Job shops
Lateness
Linear programming
Operations Research/Decision Theory
Optimization
Schedules
Scheduling
Scheduling algorithms
Studies
Supply Chain Management
Uncertainty
Integer programming
Robust optimization
Dynamic programming
Complexity
ISSN:1094-6136, 1099-1425
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we study a robust single-machine scheduling problem under four alternative optimization criteria: minimizing total completion time, minimizing total weighted completion time, minimizing maximum lateness, and minimizing the number of late jobs. We assume that job processing times are subject to uncertainty. Accordingly, we construct three alternative uncertainty sets, each of which defines job processing times that can simultaneously occur. The robust optimization framework assumes that, given a job schedule, a worst-case set of processing times will be realized from among those allowed by the uncertainty set under consideration. For each combination of objective function and uncertainty set, we first analyze the problem of identifying a set of worst-case processing times with respect to a fixed schedule, and then investigate the problem of selecting a schedule whose worst-case objective is minimal.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-015-0418-0