Due date quotation models and algorithms

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 20-1-20-22

  Kaminsky, Philip ^a   Hochbaum, Dorit ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034239852     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (50)

1. Keskinocak, P. and S. Tayur (2003), Due date management policies. In D. Simchi-Levi, D. Wu, and M. Shen (editors), Sin Supply Chain Analysis in the e Business Era, Kluwer.
2. Cheng, T. C. E. and M. C. Gupta (1989), Survey of scheduling research involving due date determination decisions. European Journal of Operational Resaerch 38, pp. 156–166.
3. Baker, K. R. and G. Scudder (1989), On the assignment of optimal due dates. Journal of the Operational Research Society 40(1), pp. 93–95.
4. Quaddus, M. A. (1987), A generalized model of optimal due date assigment by linear programming. Journal of the Operational Research Society 38(4), pp. 353–359.
5. Raghavachari, M. (1986), A V-shape property of optimal schedule of jobs about a common due date. European Journal of Operational Research 23, pp. 401–402.
6. Hall, N. G. and M. E. Posner (1991), Earliness-tardiness scheduling problems I: weighted deviation of completion times about a common due date. Operations Research 39, pp. 836–846.
7. Panwalker, S. S., M. L. Smith, and A. Seidmann (1982), Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research 30(2), pp. 391–399.
8. Cheng, T. C. E. (1988), An alternative proof of optimality for the common due date assignment problem. European Journal of Operational Research 37, pp. 250–253.
9. Kanet, J. J. (1981), Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly 28, pp. 642–651.
10. Quaddus, M. A. (1987), On the duality approach to optimal due date determination and sequencing in a job shop. Engineering Optimization 10, pp. 271–278.
11. Bagchi, U. Y.-L. Chan, and R. Sullivan (1987), Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date. Naval Research Logistics 34, pp. 739–751.
12. Cheng, T. C. E. (1987), An algorithm for the CON due date determination and sequencing problem. Computers and Operations Research 14(6), pp. 537–542.
13. Cheng, T. C. E. (1989), On a generalized optimal commondue date assignment problem. Engineering Optimization 15, pp. 113–119.
14. Cheng, T. C. E. (1989), Optimal assignment of slack due dates and sequencing in a single-machine shop. Applied Mathematics Letters 2(4), pp. 333–335.
15. Gordon, V. S. (1993), A note on optimal assignment of slack due dates in single machine scheduling. European Journal of Operational Research 70, pp. 311–315.
16. Seidmann, A, S. S. Panwalker, and M. L. Smith (1981), Optimal assignment of due dates for a single processor scheduling problem. International Journal of Production Research 19, pp. 393–399.
17. Karacapilidis, N. I. and C. P. Pappis (1995), Form similarties of the CON and SLK due date determination methods. Journal of the Operational Research Society 46(6), pp. 762–770.
18. Baker, K. R. and J. W. M. Bertrand (1981), A comparison of due date selection rules. AIIE Transactions 13(2), pp. 123–131.
19. Qi, X. and F-S Tu (1998), Scheduling a single machine to minimize earliness penalties subject to the SLK due date determination method. European Journal of Operational Research 105, pp. 502–508.
20. Gordon, V. S. and V. A. Strusevich (1998), Earliness penalties on a single machine subject to precendence constraints: SLK due date assignment. Computers & Operations Research 26, pp. 157–177.
21. Cheng, T. C. E. (1984), Optimal due date determination and sequencing of n jobs on a single machine. Journal of the Operational Research Society 35(5), pp. 433–437.
22. Cheng, T. C. E. (1988), Optimal due date assignment for a single machine problem with random processing times. International Journal of Production Research 17(8), pp. 1139–1144.
23. Baker, K. R., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan (1980), Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. Report BW128, Mathematisch Centrum, Amsterdam. Due Date Quotation Models and Algorithms 20-21
24. Baker, K. R., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan (1983), Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Operations Research 31, pp. 381–386.
25. Gordon, V. S. and V. S. Tanaev (1983), Onminimax single machine scheduling problems. Transactions of the Academie of Sciences of the BSSR 3, pp. 3–9. (in Russian)
26. Cheng, T. C. E. and V. S. Gordon (1994), Optimal assignment of due dates for preemptive singlemachine scheduling. Mathematical and Computer Modelling 20(2), pp. 33–40.
27. Kaminsky, P. M. and Z-H Lee (2003), Asymptotically Optimal Algorithms for Reliable Due Date Scheduling. Working paper, University of California, Berkeley.
28. Keskinocak, P., R. Ravi, and S. Tayur (2001), Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues. Management Science 47(2), pp. 264–279.
29. Seidmann, A. and M. L. Smith (1981), Due date assignment for production systems. Management Science 27(5), pp. 571–581.
30. Dellaert, N. (1991), Due date setting and production control. International Journal of Production Economics 23, pp. 59–67.
31. Duenyas, I. and W. J. Hopp (1995), Quoting customer lead times. Management Science 41(1), pp. 43–57.
32. Duenyas, I. (1995), Single facility due date setting multiple customer classes. Management Science 41(4), pp. 608–619.
33. Wein, L. M. (1991), Due date setting and priority sequencing in a multiclass M/G/I queue. Management Science 37(7), pp. 834–850.
34. Spearman, M. L. and R. Q. Zhang (1999), Optimal lead time policies. Management Science 45(2), pp. 290–295.
35. Hopp, W. J. and M. L. Roof Sturgis (2000), Quoting manufacturing due dates subject to a service level constraint. IIE Transactions 32, pp. 771–784.
36. So, K. C. and J-S Song (1998), Price, delivery time guarantees, and capacity selection. European Journal of Operational Research 111, pp. 28–49.
37. Palaka, K., S. Erlebacher, and D. H. Kropp (1998), Lead time setting, capacity utilization, and pricing decisions under lead-time dependent demand. IIE Transactions 30, pp. 151–163.
38. Plambeck, E. (2000), Pricing, Leadtime Quotation and Scheduling in a Queue with Heterogeneous Customers. Working paper, Stanford University.
39. Cheng, T. C. E. (1989), A heuristic for common due date assignment and job scheduling on parallel machines. Journal of the Operational Research Society 40(12), pp. 1129–1135.
40. De, Prabuddha, J. B. Ghosh, and C. E. Wells (1991), On themultiple-machine extension to a common due date assignment and scheduling problem. Journal of the Operational Research Society 42(5), pp. 419–422.
41. Sundararaghavan, P. S. and M. Ahmed (1984), Minimizing the sum of absolute lateness in singlemachine and multimachine scheduling. Naval Research Logistics Quarterly 31, pp. 325–333.
42. Shanthikumar, J. G. and U. Sumita (1988), Approximations for the time spent in a dynamic job shop, with applications to due date assignment. International Journal of Production Research 26(8), pp. 1329–1352.
43. Shanthikumar, J. G. and J. A. Buzacott (1981), Open queueing network models of dynamic job shops. International Journal of Production Research 19(3), pp. 255–266.
44. Jackson, J. R. (1963), Job shop-like queuing systems. Management Science 10, pp. 131–142.
45. Shanthikumar, J. G. and J. A. Buzacott (1984), The time spent in a dynamic job shop. European- Journal of Operational Research 17, pp. 215–226.
46. Easton, F. F. and D. R. Moodie (1999), Pricing and lead time decisions for make-to-order firms with contingent orders. European Journal of Operational Research 116, pp. 305–318.
47. Elhafsi, M. and E. Rolland (1999), Negotiating price/delivery date in a stochastic manufacturing environment. IIE Transactions 31, pp. 255–270.
48. Glasserman, P. and Y. Wang. (1998), Leadtime-inventory trade-offs in assemble-to-order systems. Operations Research 46(6), pp. 858–871.
49. Lu, Yingdong, J-S Song, and D. D. Yao (2003), Order fill rate, leadtime variability, and advance demand information in an assemble-to-order system. Operations Research 51(2), pp. 292–308.
50. Cheng, T. C. E. (1987), Optimal total-work-content-power due date determination and sequencing. Computers and Mathematical Applications 148, pp. 579–582.