2021
DOI: 10.1109/access.2021.3065109
|View full text |Cite
|
Sign up to set email alerts
|

An Evolutionary Variable Neighbourhood Search for the Unrelated Parallel Machine Scheduling Problem

Abstract: This paper addresses a challenging industrial problem known as the unrelated parallel machine scheduling problem (UPMSP) with sequence-dependent setup times. In UPMSP, we have a set of machines and a group of jobs. The goal is to find the optimal way to schedule jobs for execution by one of the several available machines. UPMSP has been classified as an NP-hard optimisation problem and, thus, cannot be solved by exact methods. Meta-heuristic algorithms are commonly used to find suboptimal solutions. However, l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
references
References 24 publications
0
0
0
Order By: Relevance