|
|
|
|
|
 |
Search published articles |
 |
|
Showing 1 results for Fixed Job Scheduling.
Dr. M. Niksirat,
Volume 9, Issue 1 (7-2018)
Abstract
In this paper bus scheduling problem under the constraints that the total number of buses needed to perform all trips is known in advance and the energy level of buses is limited, is considered. Each depot has a different time processing cost. The goal of this problem is to find a minimum cost feasible schedule for buses. A mathematical formulation of the problem is developed. When there are two depots, a polynomial time algorithm is developed for the problem and theoretical results about the complexity and correctness of the algorithm is presented. Also, several examples are introduced for illustrating validity of the algorithm.
|
|
|
|
|
|
|
|
|
