Abstract
In this paper we consider single machine common due date assignment and scheduling problem. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs. There exists a possibility to perform some action (rate-modifying activity) to change processing times of the jobs following this activity. Thus, placing the rate-modifying activity to some position in the schedule can decrease the objective function value. We consider several properties of the problem which in some cases can reduce the complexity of the solution algorithm.
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
Lawler EL, Lenstra JK, Rinnooy Kan AHG., Shmoys DB (1993): Sequencing and scheduling: Algorithms and complexity. In: Graves SC, Zipkin PH, Rinnooy Kan AHG (eds.), Logistics of Production and Inventory. Handbooks in Operations Research and Management Science, vol. 4, North-Holland, Amsterdam: 445–522.
Lee CL, Leon VJ (2001) Machine scheduling with a rate-modifying activity. European Journal of Operational Research 129: 119–128.
Mosheiov, G., Oron, D (2005): Due-date assignment and maintenance activity scheduling problem. Computers & Operations Research (to appear).
Mosheiov G, Sidney JB (2004) New results on sequencing with rate modifications. INFOR 41: 155–163.
Panwalkar SS, Smith ML, Seidmann A (1982) Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research 30: 391–399.
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
Gordon, V.S., Tarasevich, A.A. (2006). On a Single Machine Due Date Assignment and Scheduling Problem with the Rate-Modifying Activity. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_106
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_106
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)