Abstract
We consider a single processor scheduling problem with a common due window assignment. Jobs completed within the due window incur no penalty, while other jobs incur either earliness or tardiness penalties. Boundaries of the due window are decision variables. The objective is to minimize the sum of the total weighted earliness, the total weighted tardiness and due window width penalty. This problem is an extension of the classical Weighted Earliness and Tardiness problem (WET). We proved that our problem is NP-hard and presented some properties of an optimal solution. To solve the problem we constructed a dynamic programming algorithm and a fully polynomial time approximation scheme. We also presented a polynomial time algorithm for the case with unit job processing times.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bellman, R. Dynamic Programming Princeton University Press, Princeton, NJ, 1957.
Gordon, V., Proth, J.-M., Chu, C. (2002) A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139, 1–25.
Hall, N. G., Posner, M. E. (1991) Earliness-tardiness scheduling problems, i: weighted deviation of completion times about a common due date. Operations Research, 39, 836–846.
Janiak, A., Marek, M. (2001) Multi-machine scheduling problem with optimal due interval assignment subject to generalized sum type criterion. Operations Research Procedings 2001. Springer, 207–212.
Kovalyov, M.Y., Kubiak, W. (1999) A fully polynomial approximation scheme for the weighted ealiness-tardiness problem. Operations Research, 47, 757–761.
Kramer, F.-J., Lee, C.-Y. (1994) Due window scheduling for parallel machines. Mathematical Computer Modelling. 20, 69–89.
Kuhn, H. W. (1995) The hungarian method for the assignment problem. Naval Research Logistics, 2, 83–97.
Liman, S.D., Panwalkar, S.S., Thongmee, S. (1998) Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society. 49, 1007–1010.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janiak, A., Winczaszek, M. (2005). A Single Processor Scheduling Problem with a Common Due Window Assignment. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_27
Download citation
DOI: https://doi.org/10.1007/3-540-27679-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24274-1
Online ISBN: 978-3-540-27679-1
eBook Packages: Business and EconomicsBusiness and Management (R0)