Skip to main content

Batch Scheduling with a Common Due Window on a Single Machine

  • Conference paper
Fuzzy Systems and Knowledge Discovery (FSKD 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4223))

Included in the following conference series:

Abstract

A common due window scheduling problem with batching on a single machine is dealt with to minimize the total penalty of weighted earliness and tardiness. The processing time of a batch is defined as the longest processing time among the jobs in the batch. This model is motivated by applications in the manufacturing of integrated circuits. Based on several optimal properties, a polynomial algorithm is proposed for given due window.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brucker, P., Gladky, A., Hoogeveen, H., et al.: Scheduling a batching machine. Journal of Scheduling 1, 31–54 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Gordon, V., Proth, J.M., Chu, C.: A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research 139, 1–25 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kovalyov, M.Y.: Batch scheduling and common due date assignment problem: An NP-hard case. Discrete Applied Mathematics 80, 251–254 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kramer, F.J., Lee, C.Y.: Common due window scheduling. Production and Operations Management 2, 262–275 (1993)

    Article  Google Scholar 

  5. Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. European Journal of Operational Research 120, 228–249 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, H., Hu, F., Li, G. (2006). Batch Scheduling with a Common Due Window on a Single Machine. In: Wang, L., Jiao, L., Shi, G., Li, X., Liu, J. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2006. Lecture Notes in Computer Science(), vol 4223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881599_76

Download citation

  • DOI: https://doi.org/10.1007/11881599_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45916-3

  • Online ISBN: 978-3-540-45917-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics