Review on unrelated parallel machine scheduling problem with additional resources
This study deals with an unrelated parallel machine scheduling problem with additional resources (UPMR). That is one of the important sub-problems in the scheduling. UPMR consists of scheduling a set of jobs on unrelated machines. In addition to that, a number of one or more additional resources ar...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
College of Education, Al-Iraqia University
2023-05-01
|
Series: | Iraqi Journal for Computer Science and Mathematics |
Subjects: | |
Online Access: | https://journal.esj.edu.iq/index.php/IJCM/article/view/698 |
_version_ | 1797647556552949760 |
---|---|
author | Munther H. Abed Mohd Nizam Mohmad Kahar |
author_facet | Munther H. Abed Mohd Nizam Mohmad Kahar |
author_sort | Munther H. Abed |
collection | DOAJ |
description |
This study deals with an unrelated parallel machine scheduling problem with additional resources (UPMR). That is one of the important sub-problems in the scheduling. UPMR consists of scheduling a set of jobs on unrelated machines. In addition to that, a number of one or more additional resources are needed. UPMR is very important and its importance comes from the wealth of applications; they are applicable to engineering and scientific situations and manufacturing systems such as industrial robots, nurses, machine operators, bus drivers, tools, assembly plant machines, fixtures, pallets, electricity, mechanics, dies, automated guided vehicles, fuel, and more. The importance also comes from the concern about the limitation of resources that are dedicated for the production process. Therefore, researchers and decision makers are still working on UPMR problem to get an optimum schedule for all instances which have not been obtained to this day. The optimum schedule is able to increase the profits and decrease the costs whilst satisfying the customers’ needs. This research aims to review and discuss studies related to unrelated parallel machines and additional resources. Overall, the review demonstrates the criticality of resolving the UPMR problem. Metaheuristic techniques exhibit significant effectiveness in generating results and surpassing other algorithms. Nevertheless, continued improvement is essential to satisfy the evolving requirements of UPMR, which are subject to operational changes based on customer demand.
|
first_indexed | 2024-03-11T15:19:14Z |
format | Article |
id | doaj.art-7ecbb98c08884a5eb02675ecfc1ce420 |
institution | Directory Open Access Journal |
issn | 2958-0544 2788-7421 |
language | English |
last_indexed | 2024-03-11T15:19:14Z |
publishDate | 2023-05-01 |
publisher | College of Education, Al-Iraqia University |
record_format | Article |
series | Iraqi Journal for Computer Science and Mathematics |
spelling | doaj.art-7ecbb98c08884a5eb02675ecfc1ce4202023-10-29T06:13:35ZengCollege of Education, Al-Iraqia UniversityIraqi Journal for Computer Science and Mathematics2958-05442788-74212023-05-014210.52866/ijcsm.2023.02.02.020Review on unrelated parallel machine scheduling problem with additional resourcesMunther H. Abed0Mohd Nizam Mohmad Kahar1Faculty of Computing, College of Computing and Applied Sciences, University Malaysia Pahang, Pahang, MalaysiaFaculty of Computing, College of Computing and Applied Sciences, University Malaysia Pahang, Pahang, Malaysia This study deals with an unrelated parallel machine scheduling problem with additional resources (UPMR). That is one of the important sub-problems in the scheduling. UPMR consists of scheduling a set of jobs on unrelated machines. In addition to that, a number of one or more additional resources are needed. UPMR is very important and its importance comes from the wealth of applications; they are applicable to engineering and scientific situations and manufacturing systems such as industrial robots, nurses, machine operators, bus drivers, tools, assembly plant machines, fixtures, pallets, electricity, mechanics, dies, automated guided vehicles, fuel, and more. The importance also comes from the concern about the limitation of resources that are dedicated for the production process. Therefore, researchers and decision makers are still working on UPMR problem to get an optimum schedule for all instances which have not been obtained to this day. The optimum schedule is able to increase the profits and decrease the costs whilst satisfying the customers’ needs. This research aims to review and discuss studies related to unrelated parallel machines and additional resources. Overall, the review demonstrates the criticality of resolving the UPMR problem. Metaheuristic techniques exhibit significant effectiveness in generating results and surpassing other algorithms. Nevertheless, continued improvement is essential to satisfy the evolving requirements of UPMR, which are subject to operational changes based on customer demand. https://journal.esj.edu.iq/index.php/IJCM/article/view/698MakespanResource constraintsScheduling problemsUnrelated parallel machine |
spellingShingle | Munther H. Abed Mohd Nizam Mohmad Kahar Review on unrelated parallel machine scheduling problem with additional resources Iraqi Journal for Computer Science and Mathematics Makespan Resource constraints Scheduling problems Unrelated parallel machine |
title | Review on unrelated parallel machine scheduling problem with additional resources |
title_full | Review on unrelated parallel machine scheduling problem with additional resources |
title_fullStr | Review on unrelated parallel machine scheduling problem with additional resources |
title_full_unstemmed | Review on unrelated parallel machine scheduling problem with additional resources |
title_short | Review on unrelated parallel machine scheduling problem with additional resources |
title_sort | review on unrelated parallel machine scheduling problem with additional resources |
topic | Makespan Resource constraints Scheduling problems Unrelated parallel machine |
url | https://journal.esj.edu.iq/index.php/IJCM/article/view/698 |
work_keys_str_mv | AT muntherhabed reviewonunrelatedparallelmachineschedulingproblemwithadditionalresources AT mohdnizammohmadkahar reviewonunrelatedparallelmachineschedulingproblemwithadditionalresources |