Skip to main content
Springer Nature Link
Log in

The Coordination of Two Parallel Machines Scheduling and Batch Deliveries

  • Conference paper
Computing and Combinatorics (COCOON 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5092))

Included in the following conference series:

Abstract

In this paper, we consider a two-identical-parallel-machine scheduling problem with batch delivery. Although NP-hardness of this problem has been already proved by Hall and Potts, but they did not give the pseudo-polynomial-time algorithm for the problem. We prove the problem is NP-hard in the ordinary sense by constructing a pseudo-polynomial-time algorithm for the problem. We also give a polynomial-time algorithm to solve the case when the job assignment to parallel machines is given.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chang, Y.-C., Lee, C.-Y.: Machine Scheduling with Job Delivery Coordination. European Journal of Operational Research 158, 470–487 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Hall, N.G., Lesaoana, M.A., Potts, C.N.: Scheduling with Fixed Delivery Dates. Operations Research 49, 854–865 (2001)

    Article  MathSciNet  Google Scholar 

  3. Hall, N.G., Potts, C.N.: Supply Chain Scheduling: Batching and Delivery. Operations Research 51, 566–584 (2003)

    Article  MathSciNet  Google Scholar 

  4. Hall, N.G., Potts, C.N.: The Coordination of Scheduling and Batch Deliveries. Annals of Operations Research 135, 41–64 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. He, Y., Zhong, W., Gu, H.: Improved Algorithms for Two Single Machine Scheduling Problems. Theoretical Computer Science 363, 257–265 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kovalyov, M.Y., Kubiak, W.A.: A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. Journal of Heuristics 3, 287–297 (1998)

    Article  MATH  Google Scholar 

  7. Lee, C.-Y., Chen, Z.-L.: Machine Scheduling with Transportation Considerations. Journal of Scheduling 4, 3–24 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Wang, G.Q., Cheng, T.C.E.: Parallel Machine Scheduling with Batch Delivery Costs. International Journal of Production Economics 68, 177–183 (2000)

    Article  Google Scholar 

  9. Zhong, W., Dsa, G., Tan, Z.: On the Machine Scheduling Problem with Job Delivery Coordination. European Journal of Operational Research 182, 1057–1072 (2007)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Logistics Institute, Northeastern University, Shenyang, China

    Hua Gong & Lixin Tang

  2. College of Science, Shenyang Ligong University, Shenyang, China

    Hua Gong

Authors
  1. Hua Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lixin Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Xiaodong Hu Jie Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gong, H., Tang, L. (2008). The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69733-6_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69732-9

  • Online ISBN: 978-3-540-69733-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics