Zobrazeno 1 - 10
of 239
pro vyhledávání: '"Unrelated machines"'
Publikováno v:
Complex & Intelligent Systems, Vol 11, Iss 1, Pp 1-22 (2024)
Abstract The concept of green scheduling, which deals with the environmental impact of the scheduling process, is becoming increasingly important due to growing environmental concerns. Most green scheduling problem variants focus on modelling the ene
Externí odkaz:
https://doaj.org/article/8af0e9b6ac9548aeb5d4890000dae46d
Publikováno v:
International Journal of Applied Mathematics and Computer Science, Vol 33, Iss 2, Pp 285-295 (2023)
We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bo
Externí odkaz:
https://doaj.org/article/84ebf6ebcf36436692b0d901676e42e6
Autor:
Nodari Vakhania
Publikováno v:
AIMS Mathematics, Vol 8, Iss 3, Pp 7061-7082 (2023)
We consider a basic preemptive scheduling problem where $ n $ non-simultaneously released jobs are to be processed by $ m $ unrelated parallel machines so as to minimize maximum job completion time. An optimal LP-solution has been used to construct a
Externí odkaz:
https://doaj.org/article/31c340937c1a406fb47c90e195d232c0
Autor:
Marko Đurasević, Domagoj Jakobović
Publikováno v:
Axioms, Vol 13, Iss 1, p 37 (2024)
Dynamic scheduling represents an important class of combinatorial optimisation problems that are usually solved with simple heuristics, the so-called dispatching rules (DRs). Designing efficient DRs is a tedious task, which is why it has been automat
Externí odkaz:
https://doaj.org/article/3360e333fe83492db9a78b67a7e2e035
Publikováno v:
IEEE Access, Vol 10, Pp 22886-22901 (2022)
Dispatching rules are most commonly used to solve scheduling problems under dynamic conditions. Since designing new dispatching rules is a time-consuming process, it can be automated by using various machine learning and evolutionary computation meth
Externí odkaz:
https://doaj.org/article/9b2976fb316f42c9bcb0598993a07c78
Publikováno v:
International Journal of Applied Mathematics and Computer Science, Vol 30, Iss 3, Pp 573-584 (2020)
A scheduling problem in considered on unrelated machines with the goal of total late work minimization, in which the late work of a job means the late units executed after its due date. Due to the NP-hardness of the problem, we propose two meta-heuri
Externí odkaz:
https://doaj.org/article/61ab35eb66ec4e59963cbad83212846a
Autor:
Rafał Różycki, Joanna Józefowska, Krzysztof Kurowski, Tomasz Lemański, Tomasz Pecyna, Marek Subocz, Grzegorz Waligóra
Publikováno v:
Energies, Vol 16, Iss 1, p 442 (2022)
In this paper, the problem of charging electric motor vehicles on a motorway is considered. Charging points are located alongside the motorway. It is assumed that there are a number of vehicles on a given section of a motorway. In the motorway, there
Externí odkaz:
https://doaj.org/article/5b11ce8697f8446b8cdd206b3318c4d4
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.
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:
Srivastava, B.
Publikováno v:
The Journal of the Operational Research Society, 1998 Aug 01. 49(8), 886-894.
Externí odkaz:
https://www.jstor.org/stable/3009970