Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources
- Authors
- Lee, Jun-Ho; Jang, Hoon
- Issue Date
- 2-12월-2019
- Publisher
- MDPI
- Keywords
- uniform parallel machine; scheduling; dedicated machines; job splitting; setup resource; heuristic algorithm
- Citation
- SUSTAINABILITY, v.11, no.24
- Indexed
- SCIE
SSCI
SCOPUS
- Journal Title
- SUSTAINABILITY
- Volume
- 11
- Number
- 24
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/60968
- DOI
- 10.3390/su11247137
- ISSN
- 2071-1050
- Abstract
- We examine a uniform parallel machine scheduling problem with dedicated machines, job splitting, and limited setup resources for makespan minimization. In this problem, machines have different processing speeds, and each job can only be processed at several designated machines. A job can be split into multiple sections and those sections can be processed on multiple machines simultaneously. Sequence-independent setup times are assumed, and setup operations between jobs require setup operators that are limited. For the problem, we first develop a mathematical optimization model and for large-sized problems a constructive heuristic algorithm is proposed. Finally, we show that the algorithm developed is efficient and provides good solutions by experiments with various scenarios.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Global Business > Division of Convergence Business > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.