In the PhD Thesis of Kuijpers a cyclic machine scheduling problem with tool transportation is considered. For the problem with two machines, it is shown that there always exists an optimal schedule with a certain structure. This is done by means of an elaborate case study. For a number of cases some calculations are only sketched in the thesis, but not explicitly given. This paper contains a complete elaboration of the calculations that are not explicitly given in the thesis.
|Name||Memorandum / Department of Applied Mathematics|
|Publisher||Department of Applied Mathematics, University of Twente|