Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Renan Spencer Trindade"'
Publikováno v:
Encyclopedia of Optimization ISBN: 9783030546212
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a569cb55332364d91b81a4abef824ee9
https://doi.org/10.1007/978-3-030-54621-2_750-1
https://doi.org/10.1007/978-3-030-54621-2_750-1
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2020, ⟨10.1016/j.ejor.2020.12.029⟩
European Journal of Operational Research, Elsevier, 2020, ⟨10.1016/j.ejor.2020.12.029⟩
In this paper, we tackle the hydro unit commitment problem and scheduling in a hydro valley. We first decompose the problem into several simpler subproblems, one for each reservoir/plant. Then, we model each of them as an optimization problem on grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5b02ccd07837826b7ef2ee33f8fefdb
https://doi.org/10.1016/j.ejor.2020.12.029
https://doi.org/10.1016/j.ejor.2020.12.029
Publikováno v:
Combinatorial Optimization 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers
Combinatorial Optimization 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers, 12176, pp.179-190, 2020, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-53262-8_15⟩
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
Combinatorial Optimization 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers, 12176, pp.179-190, 2020, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-53262-8_15⟩
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
Problems of minimizing makespan in scheduling batch processing machines are widely exploited by academic literature, mainly motivated by burn-in tests in the semiconductor industry. The problem addressed in this work consists of grouping jobs into ba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::202d0c9342bef1807055d7865f9b375e
https://hal.archives-ouvertes.fr/hal-03104371/document
https://hal.archives-ouvertes.fr/hal-03104371/document
Publikováno v:
International Journal of Production Research
International Journal of Production Research, Taylor & Francis, 2018, 56 (22), pp.7031-7048. ⟨10.1080/00207543.2018.1424371⟩
International Journal of Production Research, Taylor & Francis, 2018, 56 (22), pp.7031-7048. ⟨10.1080/00207543.2018.1424371⟩
Problems of scheduling batch-processing machines to minimise the makespan are widely exploited in the literature, mainly motivated by real-world applications, such as burn-in tests in the semiconductor industry. These problems consist of grouping job
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73613654cca3ed7a361d1a4e6353ce1d
https://doi.org/10.1080/00207543.2018.1424371
https://doi.org/10.1080/00207543.2018.1424371
Publikováno v:
WEIT
Shisen-Sho or Four Rivers is a game with perfect information where the objective is to remove all tiles from the board. In this work we present two mixed integer programming models for solving Shisen-Sho game, as well as techniques to improve the for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bfd8913820533ee1d3b606e3d78eed8
https://doi.org/10.1109/weit.2011.26
https://doi.org/10.1109/weit.2011.26
Publikováno v:
HAL
Computers and Operations Research
Computers and Operations Research, Elsevier, 2021, 134, pp.105394. ⟨10.1016/j.cor.2021.105394⟩
Computers and Operations Research
Computers and Operations Research, Elsevier, 2021, 134, pp.105394. ⟨10.1016/j.cor.2021.105394⟩
We address the problem of scheduling jobs with non-identical sizes and distinct processing times on a single batch-processing machine, aiming at minimizing the makespan. The extensive literature on this NP-hard problem mostly focuses on heuristics. U
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c75fcd96ed0d471f17fa828d5dbe0f79
https://hal.archives-ouvertes.fr/hal-03104387
https://hal.archives-ouvertes.fr/hal-03104387