Zobrazeno 1 - 10
of 269
pro vyhledávání: '"Johnson's rule"'
Publikováno v:
The Journal of the Operational Research Society, 2004 Dec 01. 55(12), 1358-1362.
Externí odkaz:
https://www.jstor.org/stable/4101855
Publikováno v:
Computation; Volume 11; Issue 7; Pages: 137
This paper presents a comprehensive approach for minimizing makespan in the challenging two-stage hybrid flowshop with dedicated machines, a problem known to be strongly NP-hard. This study proposed a constraint programming approach, a novel heuristi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::569cbd1342e4eb62a6877f56b97d7742
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:
Omićević, Andrea
U ovom radu objašnjeni su osnovni elementi i različite vrste problema raspoređivanja. Problemi raspoređivanja spadaju u skupinu NP-teških problema, stoga se za složenije probleme koriste različite heurističke metode. Detaljno je opisan proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4131::490c3626c6281b0f12a0f8d38cef06a0
https://repozitorij.fer.unizg.hr/islandora/object/fer:9033
https://repozitorij.fer.unizg.hr/islandora/object/fer:9033
In this paper, a new method is proposed for solving octagonal fuzzy sequencing problem using new ranking method (taking k = 0.5) for converting crisp problem for finding Job sequence of two machine n jobs. The optimality for the completion of the tas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::842b483ff08ec5ab616bffe988551293
https://zenodo.org/record/5580000
https://zenodo.org/record/5580000
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
Publikováno v:
Theoretical Computer Science. 734:24-31
In the parallel k-stage flow-shops problem, we are given m identical k-stage flow-shops and a set of jobs. Each job can be processed by any one of the flow-shops but switching between flow-shops is not allowed. The objective is to minimize the makesp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04b14c78ffda880098c335279f85ca20
https://doi.org/10.1016/j.tcs.2017.09.018
https://doi.org/10.1016/j.tcs.2017.09.018
Autor:
Ali S. A. Al-Haboobi
Publikováno v:
International Journal of Computer Applications. 177:5-9
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f4311fbb21fa04ca47c203ea90d6b0a
https://doi.org/10.5120/ijca2017915684
https://doi.org/10.5120/ijca2017915684
Autor:
Tongquan Wei, Peijin Cong, Gongxuan Zhang, Kun Cao, Yue Ma, Junlong Zhou, Jianming Yan, Mingsong Chen
Publikováno v:
Journal of Systems and Software. 133:1-16
We study the problem of scheduling tasks onto a heterogeneous multi-core processor platform for makespan minimization, where each cluster on the platform has a probability of failure governed by an exponential law and the processor platform has a the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::793d91675d457495fbb25fef3805f51e
https://doi.org/10.1016/j.jss.2017.07.032
https://doi.org/10.1016/j.jss.2017.07.032
Publikováno v:
Omega. 72:15-24
In synchronous production lines it may be beneficial to leave machines idle instead of processing the next job immediately. In this paper, the effects of inserting voluntary idle times are discussed in more detail for different objective functions (m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fdd295d99a559efb69e6b5f26e33e478
https://doi.org/10.1016/j.omega.2016.10.006
https://doi.org/10.1016/j.omega.2016.10.006
Publikováno v:
International Journal of Computer Applications. 172:30-36
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ecb4bdf9fd5209f1be9f142475a8cae
https://doi.org/10.5120/ijca2017915218
https://doi.org/10.5120/ijca2017915218