Abstract
This paper deals with the vehicle and driver scheduling problems at UKM transportation department. Given daily sets of trips, drivers and non homogenous vehicles fleet, the aim is to schedule the resources in order to cover, if possible, all the trip demands. The problem formulation has been done using sequential approach where an integer programming and goal programming models have been presented respectively for vehicle scheduling problem and driver scheduling problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
