Uniform Parallel Machine Scheduling with Sequence Dependent Setup Times: A Randomized Heuristic
Loading...
Date
2022
Authors
Beste Yıldız
Levent Kandiller
Ayhan Özgür Toy
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Science and Business Media Deutschland GmbH
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
We consider the uniform parallel machine scheduling problem with sequence-dependent setup times to minimize the total completion times. This problem is known to be NP-hard. We propose a simple randomized heuristic with an improvement subroutine. We analyze the performance of the proposed heuristic through a computational study. Our computational study indicates that the heuristic performs well in terms of optimality gap and solution time. © 2022 Elsevier B.V. All rights reserved.
Description
Keywords
Full Factorial Design, Parallel Machine Scheduling, Randomized Heuristic, Sequence-dependent Setup Time, Total Completion Times, Uniform Machines, Machinery, Computational Studies, Full Factorial Design, Np-hard, Parallel Machine-scheduling Problems, Parallel Machines Scheduling, Randomized Heuristics, Sequence-dependent Setup Time, Total Completion Time, Uniform Machine, Uniform Parallel Machine Scheduling, Scheduling, Machinery, Computational studies, Full factorial design, NP-hard, Parallel machine-scheduling problems, Parallel machines scheduling, Randomized heuristics, Sequence-dependent setup time, Total completion time, Uniform machine, Uniform parallel machine scheduling, Scheduling
Fields of Science
Citation
WoS Q
Scopus Q
OpenCitations Citation Count
N/A
Source
International Symposium for Production Research ISPR2021
Volume
Issue
Start Page
End Page
Collections
PlumX Metrics
Citations
Scopus : 1
Captures
Mendeley Readers : 1
Google Scholar™
