Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Gerhard F. Post"'
Publikováno v:
Annals of operations research, 302(2), 341-362. Springer
In this paper we propose a two-phase approach to solve the shift and break design problem using integer linear programming. In the first phase we create the shifts, while heuristically taking the breaks into account. In the second phase we assign bre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f42a8e4bc7030c6e616bf9880a15486
http://www.scopus.com/inward/record.url?scp=85075910791&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85075910791&partnerID=8YFLogxK
Publikováno v:
Journal on Vehicle Routing Algorithms, 1(1), 69-71. Springer
Journal on Vehicle Routing Algorithms, 1(1), 69-71
Dullaert, W, Gromicho Dos Santos, J A, van Hoorn, J J, Post, G & Vigo, D 2018, ' The VeRoLog solver challenge 2016–2017 ', Journal on Vehicle Routing Algorithms, vol. 1, no. 1, pp. 69-71 . https://doi.org/10.1007/s41604-016-0001-7
Journal on Vehicle Routing Algorithms, 1(1), 69-71
Dullaert, W, Gromicho Dos Santos, J A, van Hoorn, J J, Post, G & Vigo, D 2018, ' The VeRoLog solver challenge 2016–2017 ', Journal on Vehicle Routing Algorithms, vol. 1, no. 1, pp. 69-71 . https://doi.org/10.1007/s41604-016-0001-7
The VeRoLog Solver Challenge 2016–2017 is the third solver challenge facilitated by VeRoLog, the EURO Working Group on Vehicle Routing and Logistics Optimization, and is organized in cooperation with ORTEC B.V. The authors constitute the organizing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab0797c64c3c9b9e41e8465452f5ba56
https://research.vu.nl/en/publications/9adf094f-5d27-4220-82f6-9eb89626efa2
https://research.vu.nl/en/publications/9adf094f-5d27-4220-82f6-9eb89626efa2
Publikováno v:
Journal of scheduling, 18(1), 29-43. Springer
This paper introduces a shift rostering problem that surprisingly has not been studied in the literature: the weekend shift rostering problem. It is motivated by our experience that employees' shift preferences predominantly focus on the weekends, si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bc101403e1e9dff3d426a2182240a7e
https://doi.org/10.1007/s10951-014-0385-x
https://doi.org/10.1007/s10951-014-0385-x
Publikováno v:
Annals of operations research, 239(1), 207-223. Springer
This paper studies a two-phase decomposition approach to solving the personnel scheduling problem. The first phase creates a days-off-schedule, indicating working days and days off for each employee. The second phase assigns shifts to the working day
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7c756164a6d7e33483f3be6852fc6ae
https://research.utwente.nl/en/publications/3d3db616-f25b-4281-8fa1-088973fed022
https://research.utwente.nl/en/publications/3d3db616-f25b-4281-8fa1-088973fed022
Publikováno v:
OR Spectrum = OR Spektrum, 34(1), 133-154. Springer
In this paper we propose a neighbourhood structure based on sequential/cyclic moves and a cyclic transfer algorithm for the high school timetabling problem. This method enables execution of complex moves for improving an existing solution, while deal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f96a1d163b38a3f395b26da43e676e8
https://doi.org/10.1007/s00291-010-0227-y
https://doi.org/10.1007/s00291-010-0227-y
Autor:
Hemant V. Unadkat, Marc Hulsman, Kamiel Cornelissen, Bernke J. Papenburg, Roman K. Truckenmüller, Anne E. Carpenter, Matthias Wessling, Gerhard F. Post, Marc Uetz, Marcel J. T. Reinders, Dimitrios Stamatialis, Clemens A. van Blitterswijk, Jan de Boer
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America, 108(40), 16565-16570. National Academy of Sciences
It is increasingly recognized that material surface topography is able to evoke specific cellular responses, endowing materials with instructive properties that were formerly reserved for growth factors. This opens the window to improve upon, in a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a08a34c5fab14372b1513137563be3b9
https://doi.org/10.1073/pnas.1109861108
https://doi.org/10.1073/pnas.1109861108
Publikováno v:
Statistica Neerlandica. 65:432-445
We describe the problem of intermodal international freight transport that is faced by some logistic service providers and the solution that ORTEC’s logistic suite offers to these customers. This solution is based on a state of the art k -shortest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de206c43d57e5e327ec6787aecbe40b7
https://doi.org/10.1111/j.1467-9574.2011.00493.x
https://doi.org/10.1111/j.1467-9574.2011.00493.x
Publikováno v:
Journal of the Operational Research Society, 62(2), 360-367. Palgrave Macmillan Ltd.
This paper describes an approach in which a local search technique is alternated with a process which ‘jumps' to another point in the search space. After each ‘jump' a (time-intensive) local search is used to obtain a new local optimum. The focus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06c4898a51679986296b97f893e37cc5
https://doi.org/10.1057/jors.2010.86
https://doi.org/10.1057/jors.2010.86
Publikováno v:
Operations research letters, 38(6), 592-596. Elsevier
Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the number of breaks is 2n−2, teams of the same club never play at home s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0642a40c52c042750e1aaf0fd3a2d316
https://doi.org/10.1016/j.orl.2010.08.008
https://doi.org/10.1016/j.orl.2010.08.008
Autor:
Gerhard J. Woeginger, Gerhard F. Post
Publikováno v:
Discrete optimization, 3(WP06-03/2), 165-173. Elsevier
Discrete Optimization, 3(2), 165-173. Elsevier
Discrete Optimization, 3(2), 165-173. Elsevier
We consider the break minimization problem for fixing home–away assignments in round-robin sports tournaments. First, we show that, for an opponent schedule with $n$ teams and $n−1$ rounds, there always exists a home–away assignment with at mos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2916b2b2ec15d2146e7d988b1b37d2b8
https://doi.org/10.1016/j.disopt.2005.08.009
https://doi.org/10.1016/j.disopt.2005.08.009