Skip to main content
SpringerLink
Log in

Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Batch processing happens in many different industries, in which a number of jobs are processed simultaneously as a batch. In this paper we develop two heuristics for the problem of scheduling jobs with release dates on parallel batch processing machines to minimize the makespan and analyze their worst-case performance ratios. We also present a polynomial-time optimal algorithm for a special case of the problem where the jobs have equal processing times.

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

Fig. 1

Similar content being viewed by others

References

  1. Bartholdi, J.J.: unpublished manuscript (1988)

  2. Brucker, P., Gladky, A., Hoogevreen, H., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T., Van de Velde, S.: Scheduling a batching machine. J Schedul 1, 31–54 (1998)

    Article  MATH  Google Scholar 

  3. Cheng, T.C.E., Liu, Z.H., Yu, W.C.: Scheduling jobs with release dates and deadlines on a batch processing machine. IIE Trans. 33, 685–690 (2001)

    Article  Google Scholar 

  4. Deng, X.T., Poon, C.K., Zhang, Y.Z.: Approximation algorithms in batch processing. J. Comb. Optim. 7, 247–257 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ikura, Y., Gimple, M.: Efficient scheduling algorithms for a single batch processing machine. Oper. Res. Lett. 5, 61–65 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lee, C.Y., Uzsoy, R.: Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int. J. Prod. Res. 37, 219–236 (1999)

    Article  MATH  Google Scholar 

  7. Lee, C.Y., Uzsoy, R., Martin Vega, L.A.: Efficient algorithm for scheduling semiconductor burn-in operations. Oper. Res. 40, 764–775 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Li, S.G., Li, G.J., Zhang, S.Q.: Minimizing makespan with release times on identical parallel batching machines. Discret. Appl. Math. 148, 127–134 (2005)

    Article  MATH  Google Scholar 

  9. Liu, Z.H., Cheng, T.C.E.: Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine. Theor. Comput. Sci. 347, 288–298 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Liu, Z.H., Yu, W.C.: Scheduling one batch processor subject to job release dates. Discret. Appl. Math. 105, 129–136 (2000)

    Article  MATH  Google Scholar 

  11. Liu, Z.H., Yuan, J.J., Cheng, T.C.E.: On scheduling an unbounded batch machine. Oper. Res. Lett. 31, 42–48 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Yuan, J.J., Liu, Z.H., Ng, C.T., Cheng, T.C.E.: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theor. Comput. Sci. 320, 199–212 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

We thank two anonymous referees for their helpful comments on an earlier version of our paper. This research was supported in part by the Logistics Research Centre of The Hong Kong Polytechnic University, and the NSFC under Grant No. 71072157. The first author was also supported by Institute of Applied Mathematics, “Dawn” Academy, Shanghai Second Polytechnic University No. A30XK121y03.

Author information

Authors and Affiliations

  1. School of Science, Shanghai Second Polytechnic University, No. 2360 Jinhai Road, Pudong Shanghai, 201209, China

    L. L. Liu

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

    C. T. Ng & T. C. E. Cheng

Authors
  1. L. L. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. T. Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. C. E. Cheng
    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

Liu, L.L., Ng, C.T. & Cheng, T.C.E. Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan. Optim Lett 8, 307–318 (2014). https://doi.org/10.1007/s11590-012-0575-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0575-4

Keywords

Search

Navigation