A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem
2017
International Transactions in Operational Research
We consider a resource-constrained project scheduling problem originating in particle therapy for cancer treatment, in which the scheduling has to be done in high resolution. Traditional mixed integer linear programming techniques such as time-indexed formulations or discrete-event formulations are known to have severe limitations in such cases, i.e., growing too fast or having weak linear programming relaxations. We suggest a relaxation based on partitioning time into so-called time-buckets.
doi:10.1111/itor.12445
fatcat:gmhukx42vrf2rfjwfz55sepex4