Skip to main content
SpringerLink
Log in

The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs

  • Conference paper
  • First Online:
Frontiers in Algorithmics (FAW 2016)

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

Included in the following conference series:

  • 546 Accesses

Abstract

The common due window scheduling problem with batching on a single machine is dealt with to minimize the total penalty of weighted earliness and tardiness. In this paper it is assumed that a job incurs no penalty as long as it is completed within the common due window. The problem is extended to the environment of non-identical job sizes. Then several optimal properties are given to schedule batches effectively. And by introducing the concept of PRN, it is proven that the PRN of each batch should be made as small as possible in order to minimize the objective. Based on these properties, an algorithm F-PRN for batch forming is proposed for the problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kramer, F.J., Lee, C.Y.: Common due-window scheduling. Prod. Oper. Manage. 2(4), 262–275 (1993)

    Article  Google Scholar 

  2. Liman, S.D., Panwalkar, S.S., Thong, S.: Determination of common due window location in a single machine scheduling problem. Eur. J. Oper. Res. 93, 68–74 (1996)

    Article  MATH  Google Scholar 

  3. Liman, S.D., Panwalkar, S.S., Thong, S.: Common due window size and location determination in a single machine scheduling. J. Oper. Res. Soc. 49, 1007–1010 (1998)

    Article  MATH  Google Scholar 

  4. Weng, M.X., Ventura, J.A.: A note on common due window scheduling. Prod. Oper. Manage. 5, 194–200 (1995)

    Article  Google Scholar 

  5. Hongluan, Z.H.A.O., Guojun, L.I.: Unbounded batch scheduling with a common due window on a single machine. J. Syst. Sci. Complexity 21(2), 296–303 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Li, C.L., Lee, C.Y.: Scheduling with agreeable release times and due dates on a batch processing machine. Eur. J. Oper. Res. 96(3), 564–569 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Pan, Q., Zhou, B.: Dynamic scheduling algorithm for E/T problem in furnace district of semiconductor fab. Semicond. Technol. 33(7), 639–643 (2008)

    Google Scholar 

  9. Yin, Y., Cheng, T., Xu, D., Wu, C.: Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost. Comput. Ind. Eng. 63(1), 223–234 (2012)

    Article  Google Scholar 

  10. Xu, R., Chen, H., Li, X.: Makespan minimization on single batch-processing machine via ant colony optimization. Comput. Oper. Res. 39(3), 582–593 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Uzsoy, R.: Scheduling a single batch processing machine with nonidentical job sizes. Int. J. Prod. Res. 32(7), 1615–1635 (1994)

    Article  MATH  Google Scholar 

  12. Sung, C.S., Choung, Y.I., Fowler, J.W.: Heuristic algorithm for minimizing earliness–tardiness on single burn-in oven in semiconductor manufacturing. In: Proceedings of MASM, pp. 217–222. Tempe, Arizona (2002)

    Google Scholar 

  13. Damodaran, P., Manjeshwar, P.K., Srihari, K.: Minimizing makespan on a batch processing machine with non-identical job sizes using genetic algorithms. Int. J. Prod. Econ. 103(2), 882–891 (2006)

    Article  Google Scholar 

  14. Chen, H., Du, B., Huang, G.Q.: Scheduling a batch processing machine with non-identical job sizes: A clustering perspective. Int. J. Prod. Res. 49(19), 5755–5778 (2011)

    Article  Google Scholar 

  15. Deng, X., Li, G., Feng, H., et al.: A PTAS for semiconductor burn-in scheduling. J. Comb. Optim. 9(1), 5–17 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This paper is supported by NSFC of Shandong Province (ZR2012GQ010), Development Projects of Science and Technology of Shandong Province (2015GGX101047, 2015GGX101018), and Ji’nan Higher Educational Independent Innovation Plan (201303001, 201401214).

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Shandong Jianzhu University, Jinan, 250101, China

    Hongluan Zhao, Guoyong Han & Gongwen Xu

  2. School of Information Science and Engineering, Shandong Normal University, Jinan, 250014, China

    Guoyong Han & Gongwen Xu

Authors
  1. Hongluan Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guoyong Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gongwen Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongluan Zhao .

Editor information

Editors and Affiliations

  1. Shandong University, Jinan, China

    Daming Zhu

  2. MS EC-31, University of Texas at Dallas, Richardson, Texas, USA

    Sergey Bereg

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhao, H., Han, G., Xu, G. (2016). The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs. In: Zhu, D., Bereg, S. (eds) Frontiers in Algorithmics. FAW 2016. Lecture Notes in Computer Science(), vol 9711. Springer, Cham. https://doi.org/10.1007/978-3-319-39817-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39817-4_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39816-7

  • Online ISBN: 978-3-319-39817-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation