Abstract
This paper considers due date assignment and sequencing for multiple jobs in a single machine shop. The processing time of each job is assumed to be uncertain and is characterized by a mean and a variance with no knowledge of the entire distribution. The objective is to minimize the combination of three penalties: penalty on job earliness, penalty on job tardiness, and penalty associated with long due date assignment. The earliness and tardiness penalties and the penalty associated with long due date assignment are all expressed quadratic functions. Heuristic procedures are developed for the objective function. The due dates and sequences obtained by these procedures depend not only on means but also variances of the job processing times. Our numerical examples indicate that the variance information of job processing times can be useful for sequencing and due date assignment decisions. In addition, the performance of the procedures proposed in this paper are robust and stable with respect to job processing time distributions.
This is a preview of subscription content, log in via an institution to check access.
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
Al-Turki, U.M., Mittenthal, J., Raghavachari, M.: The single-machine absolute-deviation early-tardy problem with random completion times. Naval Research logistics 43, 573–587 (1996)
Bagchi, U., Chang, Y., Sullivan, R.: Minimizing mean absolute deviation of completion times about a common due date. Naval Research Logistics 33, 227–240 (1986)
Bagchi, U., Chang, Y., Sullivan, R.: Minimize absolute and squared deviation of completion times with different earliness and tardiness penalties and a common due date. Naval Research Logistics 34, 739–751 (1987)
Baker, K.R., Scudder, G.D.: On the assignment of optimal due dates. Journal of Operational Research Society 40, 93–95 (1989)
Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Operations Research 38, 22–36 (1990)
Cai, X., Tu, F.S.: Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties. Naval Research Logistics 43, 1127–1146 (1996)
Cheng, T.C.E.: Optimal due-date assignment for a single machine sequencing problem with random processing times. International Journal of System Science 17, 1139–1144 (1986)
Cheng, T.C.E.: Optimal Assignment of slack due-dates and sequencing of jobs with random processing times on a single machine. European Journal of Operational Research 51, 348–353 (1991)
Cheng, T.C.E.: An algorithm for the con due date determination and sequencing problem. Computers and Operations Research 14, 537–542 (1987)
Cheng, T.C.E., Gupta, M.C.: Survey of scheduling research involving due date determination decisions. European Journal of Operational Research 38, 156–166 (1989)
Gallego, G., Moon, I.: The distribution free newsboy problem: review and extensions. Journal of Operational Research Society 44, 825–834 (1993)
Gordon, V., Strusevich, V.A.: Earliness penalties on a single maching subject to precedence constraints:SLK due daassignment. Computers & Operations Research 26, 157–177 (1999)
Hall, N.: Single and multi-processor models for minimizing completion time variance. Naval Research Logistics 33, 49–54 (1986)
Hall, N.: Scheduling problems with generalized due dates. IIE TRansactions 18, 220–222 (1986)
Kanet, J.: Minimizing variation of flow time in single machine systems. Management Science 27, 1453–1459 (1981)
Ow, P., Morton, T.: The single machine early-tardy problem. Management Science 35, 177–191 (1989)
Qi, X.D., Yin, G., Birge, J.R.: Scheduling problems with random processing times under expected earliness/tardiness costs. Stochastic Analysis and Applications 18, 453–473 (2000a)
Qi, X.D., Yin, G., Birge, J.R.: Single-machine scheduling with random machine breakdowns and randomly compressible processing times. Stochastic Analysis and Applications 18, 635–653 (2000b)
Qi, X.D., Yu, G., Bard, J.F.: Single machine schdeulign with assignable due dates. Discrete Applied Mathematics 122, 211–233 (2002)
Raghavachari, M.: Scheduling problems with non-regular penalty functions- a review. Operations Research 25, 144–164 (1988)
Scarf, H.: A min-max solution of an inventory problem. In: Arrow, K., Karlin, S., Scarf, H. (eds.) Studies in the Mathematical Theory of Inventory and Production, pp. 201–209. Stanford University Press, California (1958)
Seidmann, A., Panwalker, S.S., Smith, M.L.: Optimal assignment of due-dates for a single processor scheduling problem. International Journal of Production Research 19, 393–399 (1981)
Szwarc, W.: Single machine scheduling to minimize absolute deviation of completion times from a common due date. Naval Research logistics 36, 663–673 (1989)
Yue, J.: Distribution free optimization procedures with business application. PhD Dissertation, Washington State University (2000)
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
Xia, Y., Chen, B., Yue, J. (2005). Sequence Jobs and Assign Due Dates with Uncertain Processing Times and Quadratic Penalty Functions. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_29
Download citation
DOI: https://doi.org/10.1007/11496199_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26224-4
Online ISBN: 978-3-540-32440-9
eBook Packages: Computer ScienceComputer Science (R0)