Skip to main content
SpringerLink
Log in

Due Date Management Policies

  • Chapter
Handbook of Quantitative Supply Chain Analysis

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 74))

Abstract

To gain an edge over competitors in an increasingly global and competitive marketplace, companies today need to differentiate themselves not only in cost, but in the overall “value” of the products and the services they offer. As customers demand more and more variety of products, better, cheaper, and faster, an essential value feature for customer acquisition and retention is the ability to quote short and reliable lead times. Reliability is important for customers especially in a business-to-business setting, because it allows them to plan their own operations with more reliability and confidence [67].

Pinar Keskinocak is supported by NSF Career Award DMII-0093844.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N.R. Adam, J.W.M. Bertrand, D.C. Morehead, and J. Surkis. Due date assignment procedures with dynamically updated coefficients for multilevel assembly job shops. European Journal of Operational Research, 77: 429–439, 1994.

    Article  Google Scholar 

  2. J. Adams, E. Balas, and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management Science, 34: 391–401, 1988.

    Article  Google Scholar 

  3. U. Bagchi, Y.L. Chang, and R. Sullivan. Minimizing absolute and squarred deviations of completion imes with different earliness and tardiness penalties and a common due date. Naval Research Logistics Quarterly, 34: 739–751, 1987.

    Article  Google Scholar 

  4. K.R. Baker. The effects of input control in a simple scheduling model. Journal of Operations Management, 4: 94–112, 1984.

    Article  Google Scholar 

  5. K.R. Baker. Sequencing rules and due-date assignments in a job shop. Management Science, 30 (9): 1093–1104, 1984.

    Article  Google Scholar 

  6. K.R. Baker and J.W.M. Bertrand. A comparison of due-date selection rules. AILE Transactions, pages 123–131, June 1981a.

    Google Scholar 

  7. K.R. Baker and J.W.M. Bertrand. An investigation of due date assignment rules with constrained tightness. Journal of Operations Management, 1 (3): 37–42, 1981b.

    Article  Google Scholar 

  8. K.R. Baker and J.W.M. Bertrand. A dynamic priority rule for scheduling against due-dates. Journal of Operations Management, 3 (1): 37–42, 1982.

    Article  Google Scholar 

  9. K.R. Baker and J.J. Kanet. Job shop scheduling with modified due dates. Journal of Operations Management, 4 (1): 11–23, 1983.

    Article  Google Scholar 

  10. K.R. Baker and J.J. Kanet. Improved decision rules in a combined system for minimizing job tardiness. Journal of Operations Management, 4 (1): 11–23, 1984.

    Article  Google Scholar 

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

    Google Scholar 

  12. J.W.M. Bertrand. The effect of workload dependent due-dates on job shop performance. Management Science, 29 (7): 799–816, 1983.

    Article  Google Scholar 

  13. G.R. Bitran and D. Tirupati. Multiproduct queuing networks with deterministic routing: decomposition approach and the notion of interference. Management Science, 34 (1): 75–100, 1988.

    Article  Google Scholar 

  14. J.H. Bookbinder and A.I. Noor. Setting job-shop due-dates with service-level constraints. Journal of the Operational Research Society, 36 (11): 1017–1026, 1985.

    Google Scholar 

  15. T. Boyaci and S. Ray. Product differentiation and capacity cost interaction in time and price sensitive markets. Manufacturing and Service Operations Management, 5 (1): 18–36, 2003.

    Article  Google Scholar 

  16. K. Charnsirisakskul, P. Griffin, and P. Keskinocak. Order selection and scheduling with lead-time flexibility. Working Paper, ISYE, Georgia Institute of Technology.

    Google Scholar 

  17. K. Charnsirisakskul, P. Griffin, and P. Keskinocak. Pricing and scheduling decisions with lead-time flexibility. Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology, 2003.

    Google Scholar 

  18. S. Chatterjee, S.A. Slotnick, and M.J. Sobel. Delivery guarantees and the interdependence of marketing and operations. Production and Operations Management, 11 (3): 393–409, 2002.

    Article  Google Scholar 

  19. T.C.E. Cheng. Optimal due-date determination and sequencing of n jobs on a single machine. Journal of the Operational Research Society, 35 (5): 433–437, 1984.

    Google Scholar 

  20. T.C.E. Cheng. Optimal due-date assignment for a single machine sequencing problem with random processing times. International Journal of Systems Science, 17: 1139–1144, 1986.

    Article  Google Scholar 

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

    Article  Google Scholar 

  22. T.C.E. Cheng. An alternative proof of optimality for the common due-date assignment problem. European Journal of Operational Research, 1988.

    Google Scholar 

  23. T.C.E. Cheng. Optimal total-work-content-power due-date determination and sequencing. Computers and Mathematics with Applications, 1988.

    Google Scholar 

  24. T.C.E. Cheng. On a generalized optimal common due-date assignment problem. Engineering Optimization, 15: 113–119, 1989.

    Article  Google Scholar 

  25. T.C.E. Cheng. Optimal assignment of slack due dates and sequencing in a single-machine shop. Appl. Math. Lett., 2 (4): 333–335, 1989.

    Article  Google Scholar 

  26. T.C.E. Cheng and M.C. Gupta. Survey of scheduling research involving due date determination decisions. European Journal of Operational Research, 38: 156–166, 1989.

    Article  Google Scholar 

  27. R.W. Conway. Priority dispatching and job lateness in a job shop. The Journal of Industrial Engineering, 16 (4): 228–237, 1965.

    Google Scholar 

  28. N.P. Dellaert. Production to order. Lecture Notes in Economics and Mathematical Systems, 333, 1989. Springer, Berlin.

    Google Scholar 

  29. N.P. Dellaert. Due-date setting and production control. International Journal of Production Economics, 23: 59–67, 1991.

    Article  Google Scholar 

  30. I. Duenyas. Single facility due date setting with multiple customer classes. Management Science, 41 (4): 608–619, 1995.

    Article  Google Scholar 

  31. I. Duenyas and W.J. Hopp. Quoting customer lead times. Management Science, 41 (1): 43–57, 1995.

    Article  Google Scholar 

  32. F.F. Easton and D.R. Moodie. Pricing and lead time decisions for maketo-order firms with contingent orders. European Journal of operational research, 116: 305–318, 1999.

    Article  Google Scholar 

  33. S. Eilon and I.G. Chowdhury. Due dates in job shop scheduling. International Journal of Production Research, 14 (2): 223–237, 1976.

    Article  Google Scholar 

  34. S. Eilon and R.M. Hodgson. Job shop scheduling with due dates. International Journal of Production Research, 6 (1): 1–13, 1967.

    Article  Google Scholar 

  35. M. Elhafsi. An operational decision model for lead-time and price quotation in congested manufacturing systems. European Journal of Operational Research, 126: 355–370, 2000.

    Article  Google Scholar 

  36. M. Elhafsi and E. Rolland. Negotiating price/delivery date in a stochastic manufacturing environment. HE Transactions, 31: 225–270, 1999.

    Google Scholar 

  37. D.A. Elvers. Job shop dispatching rules using various delivery date setting criteria. Production and Inventory Management, 4: 62–70, 1973.

    Google Scholar 

  38. S.T. Enns. Job shop lead time requirements under conditions of controlled delivery performance European Journal of Operational Research, 77: 429–439, 1994.

    Article  Google Scholar 

  39. S.T. Enns. Lead time selection and the behaviour of work flow in job shops. European Journal of Operational Research, 109: 122–136, 1998.

    Article  Google Scholar 

  40. L. Enos. Report: Holiday e-sales to double. E-Commerce Times,September 6 2000. http://www.ecommercetimes.com/perl/story/4202.html.

  41. T.D Fry, P.R. Philipoom, and R.E. Markland. Due date assignment in a multistage job shop. IIE Transactions, pages 153–161, June 1989.

    Google Scholar 

  42. P. Glasserman and Y. Wang. Leadtime-inventory trade-offs in assembleto-order systems. Operations Research, 46 (6): 858–871, 1998.

    Article  Google Scholar 

  43. M.X. Goemans, M. Queyranne, A.S. Schulz, M. Skutella, and Y. Wang. Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics, 15: 165–192, 2002.

    Article  Google Scholar 

  44. M.X. Goemans, J. Wein, and D.P. Williamson. A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Operations Research Letters, 26: 149–154, 2000.

    Article  Google Scholar 

  45. V.S. Gordon. A note on optimal assignment of slack due-dates in single-machine scheduling. European Journal of Operational Research, 70: 311–315, 1993.

    Article  Google Scholar 

  46. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimiztion and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, (5): 287–326, 1979.

    Google Scholar 

  47. G.I. Green and L.B. Appel. An empirical analysis of job shop dispatch rule selection. Journal of Operations Management, 1:197–203, 1981.

    Google Scholar 

  48. A. Greene. The flow connection for e-business. Manufacturing Systems Magazine, February 2000.

    Google Scholar 

  49. S.K. Gupta and J. Kyparisis. Single machine scheduling research. Omega, 15: 207–227, 1987.

    Article  Google Scholar 

  50. D.N. Halsall, A.P. Muhlemann, and D.H.R. Price. A review of production planning and scheduling in smaller manufacturing companies in the uk. Production Planning and Control, 5: 485–493, 1984.

    Article  Google Scholar 

  51. C.W.L. Hart. The power of unconditional service guarantees. Harvard Business Review, pages 54–62, July-August 1988.

    Google Scholar 

  52. N. Hill. Delivery on the dot–or a refund! Industrial Marketing Digest, 14 (2): 43–50, 1989.

    Google Scholar 

  53. D.S. Hochbaum, K. Jansen, J.D.P. Rolim, and A. Sinclair, editors. Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX’99, Berkeley, CA, USA, August 8–11, 1999, Proceedings, volume 1671 of Lecture Notes in Computer Science. Springer, 1999.

    Google Scholar 

  54. M. Hopp, W. Spearman and D. Woodruff. Practical strategies for lead time reduction. Manufacturing Review, 3: 78–84, 1990.

    Google Scholar 

  55. W.J. Hopp and M.L. Roof Sturgis. Quoting manufacturing due dates subject to a service level constraint. HE Transactions, 32: 771–784, 2000.

    Google Scholar 

  56. P.Y. Huang. A comparative study of priority dispatching rules in a hybrid assembly/job shop. International Journal of Production Research, 22 (3): 375–387, 1984.

    Article  Google Scholar 

  57. J.R. Jackson. Job shop-lie queuing systems. Management Science, 10: 131–142, 1963.

    Article  Google Scholar 

  58. P. Kaminsky and Z.-H. Lee. Asymptotically optimal algorithms for reliable due date scheduling. Technical report, Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA, 2003.

    Google Scholar 

  59. J.J. Kanet. On anomalies in dynamic ratio type scheduling rules: A clarifying analysis. Management Science, 28 (11): 1337–1341, 1982.

    Article  Google Scholar 

  60. J.J. Kanet and J.C. Hayya. Priority dispatching with operation due dates in a job shop. Journal of Operations Management, 2 (3): 167–175, 1982.

    Article  Google Scholar 

  61. R. Kapuscinski and S. Tayur. Reliable due date setting in a capacitated MTO system with two customer classes. Working Paper, GSIA, Carnegie Mellon University.

    Google Scholar 

  62. U. Karmarker. Lot sizes, manufacturing lead times and throughput. Management Science, 33: 409–418, 1987.

    Article  Google Scholar 

  63. R. Kaufman. End fixed lead times. Manufacturing Systems, pages 68–72, January 1996.

    Google Scholar 

  64. P. Keskinocak. Satisfying customer due dates effectively. Ph.D. Thesis, GSIA, Carnegie Mellon University, 1997.

    Google Scholar 

  65. P. Keskinocak, R. Ravi, and S. Tayur. Scheduling and reliable lead time quotation for orders with availability intervals and lead time sensitive revenues. Management Science, 47 (2): 264–279, 2001.

    Article  Google Scholar 

  66. B. Kingsman, L. Worden, L. Hendry, A. Mercer, and E. Wilson. Integrating marketing and production planning in make-to-order companies. Interntional Journal of Production Economics, 30: 53–66, 1993.

    Article  Google Scholar 

  67. B.G. Kingsman, I.P. Tatsiopoulos, and L.C. Hendry. A structural methodology for managing manufacturing lead times in make-to-order companies. Management Science, 22 (12): 1362–1371, 1976.

    Article  Google Scholar 

  68. S.R. Lawrence. Estimating flowtimes and setting due-dates in complex production systems. HE Transactions, 27: 657–668, 1995.

    Google Scholar 

  69. Y. Lu, J.-S. Song, and D.D. Yao. Order fill rate, lead time variability, and advance demand information in an assemble-toorder system. Working Paper,2001. Columbia University, http://www.ieor.columbia.edu/yao/lsylrevlb.pdf.

  70. H. Matsuura, H. Tsubone, and M. Kanezashi. Setting planned lead times for multi-operation jobs. European Journal of Operational Research, 88: 287–303, 1996.

    Article  Google Scholar 

  71. S. Miyazaki. Combined scheduling system for reducing job tardiness in a job shop. International Journal of Production Research, 19 (2): 201–211, 1981.

    Article  Google Scholar 

  72. D.R. Moodie. Demand management: The evaluation of price and due date negotiation strategies using simulation. Production and Operations Management, 8 (2): 151–162, 1999.

    Article  Google Scholar 

  73. D.R. Moodie and P.M. Bobrowski. Due date demand management: negotiating the trade-off between price and delivery. International Journal of Production Research, 37 (5): 997–1021, 1999.

    Article  Google Scholar 

  74. J. Orlicky. Materials Requirements Planning. McGraw Hill, Inc., New York, 1975.

    Google Scholar 

  75. K. Palaka, S. Erlebacher, and D.H. Kropp. Lead-time setting, capacity utilization, and pricing decisions under lead-time dependent demand. TIE Transactions, 30: 151–163, 1998.

    Google Scholar 

  76. S. Panwalkar, M. Smith, and A. Seidmann. Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30 (1): 391–399, 1982.

    Article  Google Scholar 

  77. P.R. Philipoom, L.P. Rees, and L. Wiegman. Using neural networks to determine internally-set due-date asignments for shop scheduling. Decision Sciences, 25 (5/6): 825–851, 1994.

    Article  Google Scholar 

  78. P.R. Philipoom, L. Wiegman, and L.P. Rees. Cost-based due-date assignment with the use of classical and neural-network approaches. Naval Research Logistics, 44: 21–46, 1997.

    Article  Google Scholar 

  79. M. Pinedo. Scheduling: Theory, Algorithms and Systems. Prentice Hall, New Jersey, 2002.

    Google Scholar 

  80. M.A. Quaddus. A generalized model of optimal due date assignment by linear programming. Journal of the Operational Research Society, 38: 353–359, 1987.

    Google Scholar 

  81. M.A. Quaddus. On the duality approach to optimal due date determination and sequencing in a job shop. Engineering Optimization, 10: 27 1278, 1987.

    Google Scholar 

  82. G.L. Ragatz. A note on workload-dependent due date assignment rules. Journal of Operations Management, 8 (4): 377–384, 1989.

    Article  Google Scholar 

  83. G.L. Ragatz and V.A. Mabert. A simulation analysis of due date assignment rules. Journal of Operations Management, 5 (1): 27–39, 1984.

    Article  Google Scholar 

  84. M. Ragavachari. A v-shape property of optimal schedule of jobs about a common due date. European Journal of Operational Research, 23: 40 1402, 1986.

    Google Scholar 

  85. S. Ray and E.M. Jewkes. Customer lead time management when both demand and price are lead time sensitive. European Journal of Operational Research, 2003.

    Google Scholar 

  86. R.S. Russell and B.W. Taylor. An evaluation of sequencing rules for an assembly shop. Decision Sciences, 16: 196–212, 1985.

    Article  Google Scholar 

  87. A. Seidmann, S.S. Panwalkar, and M.L. Smith. Optimal assignment of due-dates for a single processor scheduling problem. International Journal of Production Research, 19 (4): 393–399, 1981.

    Article  Google Scholar 

  88. A. Seidmann and M.L. Smith. Due date assignment for production systems. Management Science, 27 (5): 571–581, 1981.

    Article  Google Scholar 

  89. T. Sen and S.K. Gupta. A state-of-art survey of static scheduling research involving due-dates. Omega, 12: 63–76, 1984.

    Article  Google Scholar 

  90. J.G. Shanthikumar and J.A. Buzacott. Open queuing network models of dynamic job shops. International Journal of Production research, 19: 255–266, 1981.

    Article  Google Scholar 

  91. J.G. Shanthikumar and J.A. Buzacott. The time spent in a dynamic job shop. European Journal of Operational Research, 17: 215–226, 1984.

    Article  Google Scholar 

  92. J.G. Shanthikumar and U. Sumita. Approximations for the time spent in a dynamic job shop with applications to due-date assignment. International Journal of Production Research, 26 (8): 1329–1352, 1988.

    Article  Google Scholar 

  93. B. Simon and R. Foley. Some results on sojourn times in acyclic jackson networks. Management Science, 25: 1027–1034, 1979.

    Article  Google Scholar 

  94. D.S. Sleator and R.S. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28: 202–208, 1985.

    Article  Google Scholar 

  95. W.E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, pages 59–66, March 1956.

    Google Scholar 

  96. K.C. So. Price and time competition for service delivery. Manufacturing and Service Operations Management, 2 (4): 392–409, 2000.

    Article  Google Scholar 

  97. K.C. So and J.-S. Song. Price, delivery time guarantees and capacity selection. European Journal of Operational Research, 111: 28–49, 1998.

    Article  Google Scholar 

  98. H.M. Soroush. Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs. European Journal of Operational Research, 113: 450–468, 1999.

    Article  Google Scholar 

  99. M.L. Spearman and R.Q. Zhang. Optimal lead time policies. Management Science, 45 (2): 290–295, 1999.

    Article  Google Scholar 

  100. R. Suri. Quick Response Manufacturing: A Companywide Approach to Reducing Lead Times. Productivity Press, Portland, OR, 1998.

    Google Scholar 

  101. S. Tayur. Improving operations and quoting accurate lead times in a laminate plant. Interfaces, 30 (5): 1–15, 2000.

    Article  Google Scholar 

  102. N.R. Tobin, A. Mercer, and B. Kingsman. A study of small subcontract and make-to-order firms in relation to quotation for orders. International Journal of Operation and Production Management, 8 (6): 46–59, 1987.

    Article  Google Scholar 

  103. G. Udo. An investigation of due-date assignment using workload information of a dynamic shop. International Journal of Production Economics, 29: 89–101, 1993.

    Article  Google Scholar 

  104. M.M. Vig and K.J. Dooley. Dynamic rules for due date assignment. International Journal of Production Research, 29 (7): 1361–1377, 1991.

    Article  Google Scholar 

  105. M.M. Vig and K.J. Dooley. Mixing static and dynamic flowtime estimates for due-date assignment. Journal of Operations Management, 11: 67–79, 1993.

    Article  Google Scholar 

  106. J.K. Weeks. A simulation study of predictable due-dates. Management Science, 25 (4): 363–373, 1979.

    Article  Google Scholar 

  107. J.K. Weeks and J.S. Fryer. A simulation study of operating policies in a hypothetical dual-constrained job shop. Management Science, 22 (12): 1362–1371, 1976.

    Article  Google Scholar 

  108. J.K. Weeks and J.S. Fryer. A methodology for assigning minimum cost due-dates. Management Science, 23 (8): 872–881, 1977.

    Article  Google Scholar 

  109. L.M. Wein. Due-date setting and priority sequencing in a multi class m/g/1 queue. Management Science, 37 (7): 834–850, 1991.

    Article  Google Scholar 

  110. Z.K. Weng. Strategies for integrating lead time and customer-order decisions. HE Transactions, 31 (2): 161–171, 1999.

    Google Scholar 

  111. R.L. Winkler and W.L. Hayes. Statistics: Probability, Inference, and Decision. Holt, Rinehart and Winston, New York, 1975.

    Google Scholar 

  112. J.D. Wisner and S.P. Siferd. A survey of us manufacturing practices in make-to-order machine shops. Production and Inventory Management Journal, 36 (1): 1–7, 1995.

    Google Scholar 

  113. W.H.M. Zijm and R. Buitenhek. Capacity planning and lead time management. International Journal of Production Economics, 46–47: 165–179, 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 30332, USA

    Pinar Keskinocak

  2. Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    Sridhar Tayur

Authors
  1. Pinar Keskinocak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sridhar Tayur
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Massachusetts Institute of Technology, USA

    David Simchi-Levi

  2. Lehigh University, USA

    S. David Wu

  3. University of Florida, USA

    Zuo-Jun Shen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media New York

About this chapter

Cite this chapter

Keskinocak, P., Tayur, S. (2004). Due Date Management Policies. In: Simchi-Levi, D., Wu, S.D., Shen, ZJ. (eds) Handbook of Quantitative Supply Chain Analysis. International Series in Operations Research & Management Science, vol 74. Springer, Boston, MA. https://doi.org/10.1007/978-1-4020-7953-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-7953-5_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-1074-8

  • Online ISBN: 978-1-4020-7953-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation