TY - JOUR
T1 - Minimizing the number of vehicles in periodic scheduling
T2 - The non-Euclidean case
AU - Kats, Vladimir
AU - Levner, Eugene
PY - 1998/6/1
Y1 - 1998/6/1
N2 - In this paper we consider the problem of minimizing the number of vehicles needed to meet a fixed periodically re-peating set of tasks where set-up times between tasks do not satisfy the triangle inequality. We reduce this problem to finding the minimal length cycle-cover in a graph. In a special case, where the set-up times satisfy the triangle inequality, we reduce the scheduling problem to the assignment problem.
AB - In this paper we consider the problem of minimizing the number of vehicles needed to meet a fixed periodically re-peating set of tasks where set-up times between tasks do not satisfy the triangle inequality. We reduce this problem to finding the minimal length cycle-cover in a graph. In a special case, where the set-up times satisfy the triangle inequality, we reduce the scheduling problem to the assignment problem.
KW - Airplane scheduling
KW - Assignment problem
KW - Minimizing the number of vehicles
KW - Periodic scheduling
KW - Polynomial algorithms
UR - http://www.scopus.com/inward/record.url?scp=0032095349&partnerID=8YFLogxK
U2 - 10.1016/s0377-2217(97)00339-1
DO - 10.1016/s0377-2217(97)00339-1
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0032095349
SN - 0377-2217
VL - 107
SP - 371
EP - 377
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 2
ER -