Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case

Vladimir Kats; Eugene Levner

doi:10.1016/s0377-2217(97)00339-1

Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case

Vladimir Kats
, Eugene Levner

Ben-Gurion University of the Negev
Holon Institute of Technology

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	371-377
Number of pages	7
Journal	European Journal of Operational Research
Volume	107
Issue number	2
DOIs	https://doi.org/10.1016/s0377-2217(97)00339-1
State	Published - 1 Jun 1998
Externally published	Yes

Keywords

Airplane scheduling
Assignment problem
Minimizing the number of vehicles
Periodic scheduling
Polynomial algorithms

Access to Document

10.1016/s0377-2217(97)00339-1

Cite this

@article{406869daaf5d47309ac7aa7363ed5379,

title = "Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case",

abstract = "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.",

keywords = "Airplane scheduling, Assignment problem, Minimizing the number of vehicles, Periodic scheduling, Polynomial algorithms",

author = "Vladimir Kats and Eugene Levner",

year = "1998",

month = jun,

day = "1",

doi = "10.1016/s0377-2217(97)00339-1",

language = "אנגלית",

volume = "107",

pages = "371--377",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "2",

}

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 - https://www.scopus.com/pages/publications/0032095349

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 -

Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this