Robust optimization for identical parallel machine scheduling with uncertain processing timeopen access
- Authors
- Seo, KK[Seo, Kwang-Kyu]; Do Chung, B[Do Chung, Byung]
- Issue Date
- 2014
- Publisher
- JAPAN SOC MECHANICAL ENGINEERS
- Keywords
- Identical parallel machine; Machine scheduling; Uncertain processing time; Robust optimization; Makespan minimization
- Citation
- JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, v.8, no.2
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING
- Volume
- 8
- Number
- 2
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/57844
- DOI
- 10.1299/jamdsm.2014jamdsm0015
- ISSN
- 1881-3054
- Abstract
- In this paper, we propose to apply robust optimization approaches to the problem of identical parallel machine scheduling with processing time uncertainty. Box uncertainty and cardinality-constrained uncertainty are considered, and robust counterpart is reformulated as deterministic MILP problems. We explore the impact of the protection level, and show the trade-off between robustness and conservativeness. The results of numerical experiments demonstrate that the robust counterpart with cardinality-constrained uncertainty outperforms that with box uncertainty with respect to the mean and standard deviation of realized objective values. However, the robust counterpart with box uncertainty has an advantage in that it requires less computational efforts to solve the problem.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Information and Communication Engineering > Information and Communication Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.