Zobrazeno 1 - 10
of 3 528
pro vyhledávání: '"parallel machines"'
Publikováno v:
Demonstratio Mathematica, Vol 57, Iss 1, Pp 107-113 (2024)
In this work, we investigate the online MapReduce processing problem on mm uniform parallel machines, aiming at minimizing the makespan. Each job consists of two sets of tasks, namely, the map tasks and the reduce tasks. A job’s map tasks can be ar
Externí odkaz:
https://doaj.org/article/72ea58a5ab014484a08dae6532adb745
Autor:
Atıl Kurt, Ferda Can Çetinkaya
Publikováno v:
International Journal of Industrial Engineering and Management, Vol 15, Iss 1, Pp 18-33 (2024)
This study considers the scheduling problem of multiple independent and non-resumable jobs on unrelated parallel machines subject to machine availability and eligibility constraints. For each machine, there is a maximum continuous working time due to
Externí odkaz:
https://doaj.org/article/8d1a84c36e344ef997591f4c0a8de27d
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Access, Vol 12, Pp 156893-156903 (2024)
This paper suggests a technique to reduce noise in DC current measurements within an integrated power conversion system, which includes a three-phase inverter and a full-bridge converter both utilizing single shunt resistors as current sensors. Typic
Externí odkaz:
https://doaj.org/article/78cab5fc8ab74d61a4ca61e9a2ecc6f3
Autor:
Ouissem Mesli-Kesraoui, Loic Ledreck, Emmanuel Grolleau, Soraya Kesraoui, Pascal Berruet, Yassine Ouhammou, Patrick Girard
Publikováno v:
EURO Journal on Computational Optimization, Vol 12, Iss , Pp 100093- (2024)
In civil aircraft, two partially redundant hydraulic circuits typically power various systems. During assembly, a critical phase involves simultaneously rinsing and purging these hydraulic circuits using loops. Precedence constraints are necessary to
Externí odkaz:
https://doaj.org/article/74d10e6520004c86af5a5872a5a860d4
Autor:
Sara Kamran, Javad Behnamian
Publikováno v:
چشمانداز مدیریت صنعتی, Vol 13, Iss 3, Pp 223-248 (2023)
Today, due to some challenges and competition, such as external pressures, factories are forced to reduce production time, traditional centralized production scheduling is not flexible enough to respond to rapid market changes. In such an environment
Externí odkaz:
https://doaj.org/article/0e62e490c88342929fc484924e77b938
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Felipe T. Muñoz, Rodrigo Linfati
Publikováno v:
Mathematics, Vol 12, Iss 14, p 2223 (2024)
This article investigates the performance of the Weighted Shortest Processing Time (WSPT) rule as a local sequencing policy in a scheduling game for uniformly related parallel machines, where the social objective is the total weighted completion time
Externí odkaz:
https://doaj.org/article/5452b9bfc6ad4a15922f68cc0a96eda1
Autor:
Khaled Bamatraf, Anis Gharbi
Publikováno v:
Systems, Vol 12, Iss 6, p 221 (2024)
This paper investigates a uniform parallel machine scheduling problem for makespan minimization. Due to the problem’s NP-hardness, much effort from researchers has been directed toward proposing heuristic and metaheuristic algorithms that can find
Externí odkaz:
https://doaj.org/article/243dcbde989b47f79d851ad2cd2b8f63
Publikováno v:
Complex & Intelligent Systems, Vol 10, Iss 1, Pp 781-809 (2023)
Abstract This paper deals with a reentrant hybrid flow shop problem with sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model with the minimization of total weighte
Externí odkaz:
https://doaj.org/article/889c21a242724d1f90c8607abf9be8b0