2021
DOI: 10.1002/int.22733
|View full text |Cite
|
Sign up to set email alerts
|

Advanced discrete firefly algorithm with adaptive mutation‐based neighborhood search for scheduling unrelated parallel machines with sequence‐dependent setup times

Abstract: The unrelated parallel machine scheduling problem with sequence-dependent setup times is addressed in this paper with the objective of minimizing the elapsed time between the start and finish of a sequence of operations in a set of unrelated machines. The machines are considered unrelated because the processing speed is dependent on the job being executed and not on the individual machines. Generally, the problem is considered NP-hard, as it presents additional complexity to find an optimal solution in terms o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
25
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7

Relationship

4
3

Authors

Journals

citations
Cited by 8 publications
(25 citation statements)
references
References 43 publications
0
25
0
Order By: Relevance
“…Therefore, they are more suitable for solving small-sized problem instances. In this paper, we adopt and enhance the MIP formulation presented in previous studies for minimizing the makespan of the UPMSP (Anagnostopoulos and Rabadi, 2002;Helal, Rabadi, and Al-Salem, 2006;Ezugwu and Akutsah, 2018;Ezugwu, 2019;2022). We believe that our MIP model provides a clear theoretical foundation for the variant of the parallel machine problem addressed in this research.…”
Section: Problem Formulation and Mathematical Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore, they are more suitable for solving small-sized problem instances. In this paper, we adopt and enhance the MIP formulation presented in previous studies for minimizing the makespan of the UPMSP (Anagnostopoulos and Rabadi, 2002;Helal, Rabadi, and Al-Salem, 2006;Ezugwu and Akutsah, 2018;Ezugwu, 2019;2022). We believe that our MIP model provides a clear theoretical foundation for the variant of the parallel machine problem addressed in this research.…”
Section: Problem Formulation and Mathematical Modelmentioning
confidence: 99%
“…These concepts were adapted from the work of Ezugwu and Akutsah (2018), Ezugwu (2019), and Ezugwu (2022), and discussed in more detail in this paper.…”
Section: Application Of Metaheuristics For Upmspsmentioning
confidence: 99%
See 1 more Smart Citation
“…Companies would use these systems to know where to position product adverts or offers. Many online retailers can better manage inventory and optimize logistics, such as warehousing, using predictive modeling based on machine learning techniques [ 142 ]. Furthermore, machine learning techniques enable companies to maximize profits by creating packages and content tailored to their customer's needs, allowing them to maintain existing customers while attracting new ones.…”
Section: Machine Learning Researchmentioning
confidence: 99%
“…This section covers the answers to the designed research questions stated in Section 3.1, with each subsection distinctly handling answers to each research question. Meta-heuristics techniques are developed for providing optimal solutions to optimization problems through iterative exploration and exploitation of the entire search space [20]. A number of these algorithms have been integrated with the traditional K-means algorithm to improve the process of data clustering.…”
Section: Data Synthesis and Analysismentioning
confidence: 99%