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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brucker, P., Gladky, A., Hoogeveen, H., et al.: Scheduling a batching machine. Journal of Scheduling 1, 31–54 (1998)
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)
Kovalyov, M.Y.: Batch scheduling and common due date assignment problem: An NP-hard case. Discrete Applied Mathematics 80, 251–254 (1997)
Kramer, F.J., Lee, C.Y.: Common due window scheduling. Production and Operations Management 2, 262–275 (1993)
Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. European Journal of Operational Research 120, 228–249 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)