Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/1245
Title: | A Vehicle Scheduling Problem With Fixed Trips and Time Limitations | Authors: | Eliiyi Türsel, Deniz Örnek, Mustafa Arslan Karakutuk, Sadik Serhat |
Keywords: | Vehicle scheduling Fixed job scheduling Time constraints Heuristics Machines |
Publisher: | Elsevier Science Bv | Abstract: | We consider minimum-cost scheduling of different vehicle types on a predetermined set of one-way trips. Trips have predetermined ready times, deadlines and associated demands. All trips Must be performed. The total time of operations on any vehicle is limited. We develop a mixed integer model to find the optimal number of vehicles at a minimum cost. Based on the hard nature of the problem, we propose six heuristics. Computational results reveal that heuristics return exceptionally good solutions for problem instances with up to 100 jobs in very small computation times, and are likely to perform well for larger instances. (C) 2008 Elsevier B.V. All rights reserved. | URI: | https://doi.org/10.1016/j.ijpe.2008.10.005 https://hdl.handle.net/20.500.14365/1245 |
ISSN: | 0925-5273 |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
22
checked on Mar 26, 2025
WEB OF SCIENCETM
Citations
16
checked on Mar 26, 2025
Page view(s)
90
checked on Mar 31, 2025
Download(s)
6
checked on Mar 31, 2025
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.