Skip to main content
Springer Nature Link
Log in

Sequence Jobs and Assign Due Dates with Uncertain Processing Times and Quadratic Penalty Functions

  • Conference paper
Algorithmic Applications in Management (AAIM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3521))

Included in the following conference series:

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

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Article  MATH  Google Scholar 

  2. 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)

    Article  MATH  MathSciNet  Google Scholar 

  3. 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)

    Article  MATH  MathSciNet  Google Scholar 

  4. Baker, K.R., Scudder, G.D.: On the assignment of optimal due dates. Journal of Operational Research Society 40, 93–95 (1989)

    MATH  Google Scholar 

  5. Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Operations Research 38, 22–36 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. 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)

    Article  MATH  MathSciNet  Google Scholar 

  7. 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)

    Article  MATH  Google Scholar 

  8. 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)

    Article  MATH  Google Scholar 

  9. Cheng, T.C.E.: An algorithm for the con due date determination and sequencing problem. Computers and Operations Research 14, 537–542 (1987)

    Article  MATH  Google Scholar 

  10. 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)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gallego, G., Moon, I.: The distribution free newsboy problem: review and extensions. Journal of Operational Research Society 44, 825–834 (1993)

    MATH  Google Scholar 

  12. 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)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hall, N.: Single and multi-processor models for minimizing completion time variance. Naval Research Logistics 33, 49–54 (1986)

    Article  MATH  Google Scholar 

  14. Hall, N.: Scheduling problems with generalized due dates. IIE TRansactions 18, 220–222 (1986)

    Article  Google Scholar 

  15. Kanet, J.: Minimizing variation of flow time in single machine systems. Management Science 27, 1453–1459 (1981)

    Article  MATH  Google Scholar 

  16. Ow, P., Morton, T.: The single machine early-tardy problem. Management Science 35, 177–191 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  17. 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)

    Article  MATH  MathSciNet  Google Scholar 

  18. 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)

    Article  MATH  MathSciNet  Google Scholar 

  19. Qi, X.D., Yu, G., Bard, J.F.: Single machine schdeulign with assignable due dates. Discrete Applied Mathematics 122, 211–233 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  20. Raghavachari, M.: Scheduling problems with non-regular penalty functions- a review. Operations Research 25, 144–164 (1988)

    MATH  MathSciNet  Google Scholar 

  21. 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)

    Google Scholar 

  22. 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)

    Article  Google Scholar 

  23. Szwarc, W.: Single machine scheduling to minimize absolute deviation of completion times from a common due date. Naval Research logistics 36, 663–673 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  24. Yue, J.: Distribution free optimization procedures with business application. PhD Dissertation, Washington State University (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management and Marketing, Fort Hays State University, Hays, KS, 67601, USA

    Yu Xia

  2. Department of Management and Decision Sciences, Washington State University, Pullman, WA, 99164, USA

    Bintong Chen

  3. Department of Management and Marketing, Middle Tennessee State University, Murfreesboro, TN, 37132, USA

    Jinfeng Yue

Authors
  1. Yu Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bintong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jinfeng Yue
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM Almaden Research Center, 650 Harry Road, 95120, San Jose, CA,  

    Nimrod Megiddo

  2. The State Key Lab for Manufacturing Systems Engineering, 710049, Xi’an, P.R. China

    Yinfeng Xu

  3. Department of Computer Science, Montana State University, 59717, Bozeman, MT, USA

    Binhai Zhu

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics