Title of article
The complexity of cost constrained vehicle scheduling problem
Author/Authors
Niksirat, Malihe Department of Computer Science - Faculty of Computer and Industrial Engineering - Birjand University of Technology, Birjand, Iran , Hashemi, Naser Department of Mathematics and Computer Science - Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran
Pages
7
From page
109
To page
115
Abstract
This paper considered the cost constrained vehicle scheduling problem under the constraint that the total number of vehicles is known in advance. Each depot has a different time processing cost. The goal of this problem is to find a feasible minimum cost schedule for vehicles. A mathematical formulation of the problem is developed and the complexity of the problem when there are more than two depots is investigated. It is proved that in this case, the problem is NP-complete. Also, it is showed that there is not any constant ratio approximation algorithm for the problem, i.e., it is in the complexity class APX.
Keywords
Vehicle scheduling problem , Fixed job scheduling , NP-complete , Approximation algorithm , APX
Journal title
AUT Journal of Mathematics and Computing
Serial Year
2021
Record number
2727567
Link To Document