Zobrazeno 1 - 10
of 107
pro vyhledávání: '"Patrick De Causmaecker"'
Publikováno v:
European Journal of Operational Research. 301:841-854
ispartof: European Journal Of Operational Research vol:301 issue:3 pages:841-854 status: Published online
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9485fdd41f9ad47824e48f30610d25be
https://doi.org/10.1016/j.ejor.2021.12.009
https://doi.org/10.1016/j.ejor.2021.12.009
Publikováno v:
INFORMS Journal on Computing.
Patient scheduling is a difficult task involving stochastic factors, such as the unknown arrival times of patients. Similarly, the scheduling of radiotherapy for cancer treatments needs to handle patients with different urgency levels when allocating
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afac03db2e8e834a6bf9703cddb770c0
https://doi.org/10.1287/ijoc.2023.1289
https://doi.org/10.1287/ijoc.2023.1289
Publikováno v:
Journal of scheduling. 25(3)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4712f147c93aaf32c7b4c8d4f22432e5
https://pubmed.ncbi.nlm.nih.gov/35729986
https://pubmed.ncbi.nlm.nih.gov/35729986
Publikováno v:
Applied Soft Computing. 136:109919
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d01c42e0912d0c86c1a1a32750289f9
https://doi.org/10.1016/j.asoc.2022.109919
https://doi.org/10.1016/j.asoc.2022.109919
Publikováno v:
European Journal of Operational Research. 286:115-128
We consider a single-machine scheduling problem with release dates and inventory constraints. Each job has a deterministic processing time and has an impact (either positive or negative) on the central inventory level. We aim to find a sequence of jo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::255a418b81edf49944c86798659103b2
https://doi.org/10.1016/j.ejor.2020.03.029
https://doi.org/10.1016/j.ejor.2020.03.029
Decades of research on the 0-1 knapsack problem led to very efficient algorithms that are able to quickly solve large problem instances to optimality. This prompted researchers to also investigate whether relatively small problem instances exist that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e1222a591170c4057143a4901dfd8e9
Publikováno v:
Computers & industrial engineering
In the literature, much effort has been devoted to providing taxi drivers with recommendations on how to find passengers efficiently. However, the load balancing problem is not taken seriously, leading to a situation where taxis gather and compete at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1447700cfeda33a1a91a0b8f30a79a0
https://hdl.handle.net/10067/1895120151162165141
https://hdl.handle.net/10067/1895120151162165141
Publikováno v:
Computers & Operations Research. 149:106019
Predicting and comparing algorithm performance on graph instances is challenging for multiple reasons. First, there is usually no standard set of instances to benchmark performance. Second, using existing graph generators results in a restricted spec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::392f73bb99f9a7fc0a15828560b5801e
https://doi.org/10.1016/j.cor.2022.106019
https://doi.org/10.1016/j.cor.2022.106019
Publikováno v:
Computers & Industrial Engineering. 171:108430
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::805865884a6624ddb1ea42a51f3834cc
https://doi.org/10.1016/j.cie.2022.108430
https://doi.org/10.1016/j.cie.2022.108430
Publikováno v:
Computers & Operations Research. 103:184-197
© 2018 Elsevier Ltd The goal of this paper is to investigate the impact of different solution representations, as part of a metaheuristic approach, on net present value optimization in project scheduling. We specifically consider the discrete time/c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f46ed18f134e226abc611e5de188fdaf
https://doi.org/10.1016/j.cor.2018.11.011
https://doi.org/10.1016/j.cor.2018.11.011