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 $\frac{\sqrt{5}+1}{2}\approx1.618$ . When preemption is not allowed, we provide an on-line algorithm which has the best competitive ratio $\frac{\sqrt{5}+1}{2}\approx1.618$ for the case c=1 and has an asymptotic competitive ratio $\frac{\sqrt{5}+1}{2}\approx1.618$ for the case c?2.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
