Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Equal length jobs"'
Autor:
Vadim V. Romanuke
Publikováno v:
KPI Science News, Iss 2 (2020)
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending orde
Externí odkaz:
https://doaj.org/article/ca71c23583894f8aa7e610d048d5a216
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:
Vadim V. Romanuke
Publikováno v:
Наукові вісті КПІ; № 2 (2020); 64-73
KPI Science News; № 2 (2020); 64-73
Научные вести КПИ; № 2 (2020); 64-73
KPI Science News, Vol 0, Iss 2, Pp 64-73 (2020)
KPI Science News; № 2 (2020); 64-73
Научные вести КПИ; № 2 (2020); 64-73
KPI Science News, Vol 0, Iss 2, Pp 64-73 (2020)
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending orde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50fd64be48ae86d80a6b40f44a3719e0
https://doi.org/10.20535/kpi-sn.2020.2.181869
https://doi.org/10.20535/kpi-sn.2020.2.181869
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:
Theoretical Computer Science. 457:174-180
We consider the online scheduling on two identical parallel machines with chain precedence constraints to minimize makespan, where jobs arrive over time and have identical processing times. For this online scheduling problem, Huo and Leung [Y. Huo an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27ba736618717a95f639946518cc736b
https://doi.org/10.1016/j.tcs.2012.07.009
https://doi.org/10.1016/j.tcs.2012.07.009
Autor:
Walter Unger, George B. Mertzios
Publikováno v:
Mathematics in computer science, 2010, Vol.3(1), pp.73-84 [Peer Reviewed Journal]
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighted completion times \({\sum_{i=1}^{n}w_{i}C_{i}}\) of the jobs. We prop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a41eadafb9328a9f854ec4b16a64f51b
https://doi.org/10.1007/s11786-009-0003-z
https://doi.org/10.1007/s11786-009-0003-z
In this paper a Boolean Linear Programming (BLP) model is presented for the single machine scheduling problem 1 vertical bar pmtn; p(j) = 2;r(j)vertical bar Sigma w(j)C(j). The problem is a special case of the open problem 1 vertical bar pmtn; p(j) =
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___01423::2c33104d44ba408e3ba3f358d5fc3334
https://research.rug.nl/en/publications/1041b2ed-c8ab-4169-81ab-0b7af13be6b5
https://research.rug.nl/en/publications/1041b2ed-c8ab-4169-81ab-0b7af13be6b5
In this paper a Boolean Linear Programming (BLP) model is presented for the single machine scheduling problem 1 vertical bar pmtn; p(j) = 2;r(j)vertical bar Sigma w(j)C(j). The problem is a special case of the open problem 1 vertical bar pmtn; p(j) =
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::c5b9a0097f93c5a778dfc5ce7175c773
https://hdl.handle.net/11370/1041b2ed-c8ab-4169-81ab-0b7af13be6b5
https://hdl.handle.net/11370/1041b2ed-c8ab-4169-81ab-0b7af13be6b5
Autor:
Bouma, Harmen W., Goldengorin, Boris, Lagakos, S, Perlovsky, L, Jha, M, Covaci, B, Zaharim, A, Mastorakis, N
Publikováno v:
PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS, 415-420
STARTPAGE=415;ENDPAGE=420;TITLE=PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS
STARTPAGE=415;ENDPAGE=420;TITLE=PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS
In this paper a Boolean Linear Programming (BLP) model is presented for the single machine scheduling problem 1 vertical bar pmtn; p(j) = 2;r(j)vertical bar Sigma w(j)C(j). The problem is a special case of the open problem 1 vertical bar pmtn; p(j) =
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::955b7c25beafbf6c65ff97431710c121
https://research.rug.nl/en/publications/1041b2ed-c8ab-4169-81ab-0b7af13be6b5
https://research.rug.nl/en/publications/1041b2ed-c8ab-4169-81ab-0b7af13be6b5