Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Nilson Felipe Matos Mendes"'
Publikováno v:
European Journal of Operational Research, 295(3), 823-837. Elsevier Science BV
In this work, we study the problem of scheduling jobs and maintenance activities on a set of unrelated parallel machines, by considering that the processing time of a job increases according to a deterioration factor that depends both on the machine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::690c3bffe815509799e93146342a161c
https://research.tilburguniversity.edu/en/publications/576dedcc-e1fb-4423-96db-cad62c9f608a
https://research.tilburguniversity.edu/en/publications/576dedcc-e1fb-4423-96db-cad62c9f608a
Publikováno v:
ICEIS (1)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0ffc04744e43668ae01f7637ad4b70b
https://doi.org/10.5220/0009364403390349
https://doi.org/10.5220/0009364403390349
Publikováno v:
ICEIS (2)
Providing security requires efficient police services. Considering this, we deal in this paper with the police units allocation problem. To describe the problem a probabilistic model based on Hypercube Queuing Model is proposed. Considering an action
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9882c40329da33fdaf9ab67691c04e8
https://doi.org/10.5220/0005837800700081
https://doi.org/10.5220/0005837800700081
Publikováno v:
CLEI
Public safety is one of most demanding areas in public administration, having direct consequences on people welfare. Creating crime containment strategies or providing a fast answer to emergency situations when they occurs is a challenge. In this pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f66680b5ee1fed1971ff9f33fc1cef8
https://doi.org/10.1109/clei.2015.7359471
https://doi.org/10.1109/clei.2015.7359471
Publikováno v:
CLEI
This paper considers the Flowshop Sequence Dependent Group Scheduling (FSDGS) problem In this problem, the n jobs to be processed on m machines are grouped in families (or groups) in a way that a machine setup time is needed between two consecutive j
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b674d0876dfa1c8aa1f3e97ea6827afa
https://doi.org/10.1109/clei.2013.6670645
https://doi.org/10.1109/clei.2013.6670645
Publikováno v:
2015 Latin American Computing Conference (CLEI); 2015, p1-11, 11p
Publikováno v:
2013 XXXIX Latin American Computing Conference (CLEI); 2013, p1-5, 5p
Publikováno v:
2013 XXXIX Latin American Computing Conference (CLEI); 2013, p1-7, 7p