Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Averbakh, I. (2010). On-line integrated production-distribution scheduling problems with capacitated deliveries. European Journal of Operational Research, 200, 377–384.

    Article  Google Scholar 

  • Chang, Y.-C., & Lee, C.-Y. (2004). Machine scheduling with job delivery coordination. European Journal of Operational Research, 158, 470–487.

    Article  Google Scholar 

  • Chen, Z.-L. (2010). Integrated production and outbound distribution scheduling: review and extensions. Operations Research, 58, 130–148.

    Article  Google Scholar 

  • Chen, Z.-L., & Vairaktarakis, G. L. (2005). Integrated scheduling of production and distribution operations. Management Science, 51, 614–628.

    Article  Google Scholar 

  • Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: batching and delivery. Operations Research, 51, 566–584.

    Article  Google Scholar 

  • Hall, L. A., & Shmoys, D. B. (1992). Johnson’s rule for single-machine scheduling: making a good heuristic better. Mathematics of Operations Research, 17, 22–35.

    Article  Google Scholar 

  • Hoogeveen, J. A., & Vestjen, A. P. A. (2000). A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM Journal on Discrete Mathematics, 13, 56–63.

    Article  Google Scholar 

  • Lee, C.-Y., & Chen, Z.-L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3–24.

    Article  Google Scholar 

  • Lu, L. F., & Yuan, J. J. (2008a). Unbounded parallel batch scheduling problem with job delivery to minimize makespan. Operations Research Letters, 36, 477–480.

    Article  Google Scholar 

  • Lu, L. F., & Yuan, J. J. (2008b). Single machine scheduling with job delivery to minimize makespan. Asia-Pacific Journal of Operational Research, 25, 1–10.

    Article  Google Scholar 

  • Lu, L. F., Yuan, J. J., & Zhang, L. Q. (2008). Single machine scheduling with release dates and job delivery to minimize the makespan. Theoretical Computer Science, 393, 102–108.

    Article  Google Scholar 

  • Potts, C. N. (1980). Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research, 28, 1436–1441.

    Article  Google Scholar 

  • Sung, C. S., & Kim, Y. H. (2002). Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Computers & Operations Research, 29, 275–294.

    Article  Google Scholar 

  • van de Akker, M., Hoogeveen, H., & Vakhania, N. (2000). Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Journal of Scheduling, 3, 333–341.

    Article  Google Scholar 

  • Zhang, G. C., Cai, X. Q., & Wong, C. K. (2001). On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48, 241–258.

    Article  Google Scholar 

  • Zhang, X. D., & van de Velde, S. (2010). On-line two-machine job shop scheduling with time lags. Information Processing Letters, 110, 510–513.

    Article  Google Scholar 

  • Zhong, W. Y., Chen, Z.-L., & Chen, M. (2010). Integrated production and distribution scheduling with committed delivery dates. Operations Research Letters, 38, 133–138.

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported in part by The Hong Kong Polytechnic University under Grant Number G-YX1S. The second author was also supported in part by grants NSFC (10901142) and NFSC-RGC (70731160633).

Author information

Authors and Affiliations

  1. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    C. T. Ng & Lingfa Lu

  2. Department of Mathematics, Zhengzhou University, Zhengzhou, Henan, 450001, People’s Republic of China

    Lingfa Lu

Authors
  1. C. T. Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lingfa Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to C. T. Ng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ng, C.T., Lu, L. On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time. J Sched 15, 391–398 (2012). https://doi.org/10.1007/s10951-011-0260-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-011-0260-y

Keywords

Search

Navigation