Uniform Parallel Machine Scheduling with Sequence Dependent Setup Times: A Randomized Heuristic
Loading...
Date
2022
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
SPRINGER-VERLAG SINGAPORE PTE LTD
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
Description
ORCID
Keywords
Parallel machine scheduling, Sequence-dependent setup time, Full factorial design, Randomized heuristic, Uniform machines, Total completion times, METAHEURISTIC ALGORITHM, Full Factorial Design, Parallel Machine Scheduling, Total Completion Times, Sequence-Dependent Setup Time, Randomized Heuristic, Uniform Machines
Fields of Science
Citation
WoS Q
Scopus Q
OpenCitations Citation Count
N/A
Source
21st International Symposium on Production Research (ISPR) - Digitizing Production System
Volume
Issue
Start Page
812
End Page
825
PlumX Metrics
Citations
Scopus : 1
Captures
Mendeley Readers : 1
Google Scholar™
