On‐line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time

On‐line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time

0.00 Avg rating0 Votes
Article ID: iaor20123929
Volume: 15
Issue: 3
Start Page Number: 391
End Page Number: 398
Publication Date: Jun 2012
Journal: Journal of Scheduling
Authors: ,
Keywords: production, combinatorial optimization, vehicle routing & scheduling
Abstract:

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 c jobs to the customer at a time. When preemption is allowed and c≥2, we can provide an on‐line algorithm with the best competitive ratio 5 + 1 2 1.618 equ1 . When preemption is not allowed, we provide an on‐line algorithm which has the best competitive ratio 5 + 1 2 1.618 equ2 for the case c=1 and has an asymptotic competitive ratio 5 + 1 2 1.618 for the case c≥2.

Reviews

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