Production-and-delivery scheduling with transportation mode selection allowed

Production-and-delivery scheduling with transportation mode selection allowed

0.00 Avg rating0 Votes
Article ID: iaor20073181
Country: South Korea
Volume: 32
Issue: 3
Start Page Number: 163
End Page Number: 171
Publication Date: Sep 2006
Journal: Journal of the Korean Institute of Industrial Engineers
Authors: , ,
Keywords: vehicle routing & scheduling, programming: dynamic, programming: branch and bound
Abstract:

This paper considers a scheduling problem to minimize the sum of the associated scheduling (production/delivery times) cost and the delivery cost for an integrated system of a single production machine and various transportation vehicles with transportation mode selection allowed. Each transportation mode is provided with a fixed number of vehicles at the associated delivery time and cost. The proposed problem is characterized as being NP-hard. Some solution properties are also characterized. Therewith, three heuristic algorithms (called SPT-based, LWF-based and WSPT-based heuristic) and a branch-and-bound algorithm are derived. In order to evaluate the effectiveness and efficiency of the proposed algorithms, computational experiments are made with some numerical instances.

Reviews

Required fields are marked *. Your email address will not be published.