Article ID: | iaor20123929 |
Volume: | 15 |
Issue: | 3 |
Start Page Number: | 391 |
End Page Number: | 398 |
Publication Date: | Jun 2012 |
Journal: | Journal of Scheduling |
Authors: | Lu Lingfa, Ng C |
Keywords: | production, combinatorial optimization, vehicle routing & scheduling |
In this paper, we consider the on‐line integrated production and outbound distribution scheduling problem to minimize the maximum delivery completion time. All jobs arrive over time, and each job and its processing time become known at its arrival time. The jobs are first processed on a single machine and then delivered by a vehicle to a single customer. The vehicle can deliver at most