Scalability and performance of computational structures for real-time order promising

Journal of Intelligent Manufacturing

Volumn 16, Issue 1, 2005, Pages 5-20

  Lucas, Andres J ^a   Moses, Scotta A ^a  

^a University of Oklahoma   (United States)

Author keywords

Build to order; Due date assignment; Index structures; Main memory databases; Order promising

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; DATABASE SYSTEMS; LINEAR SYSTEMS; PARAMETER ESTIMATION; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

BUILD-TO-ORDER; DUE DATE ASSIGNMENT; INDEX STRUCTURES; MAIN-MEMORY DATABASES; ORDER PROMISING;

REAL TIME SYSTEMS;

EID: 14844362583     PISSN: 09565515     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10845-005-4821-9     Document Type: Article

References (34)

1. N. R. Adam J. W. M. Bertrand D. C. Morehead J. Surkis 1993 Due date assignment procedures with dynamically updated coefficients for multi-level assembly job shops European Journal of Operational Research 68 212 227
2. Ammann, A. C., Hanrahan, M. B. and Krishnamurthy, R. (1985). Design of a memory resident DBMS. Proceedings of the IEEE Spring Computer Conference, 54-57.
3. K. R. Baker J. W. M. Bertrand 1981 An investigation of due-date assignment rules with constrained tightness Journal of Operations Management 1 109 120
4. J. W. M. Bertrand 1983 The effect of workload dependent due-dates on job shop performance Management Science 29 799 816
5. J. Blackburn 1991 Time Based Competition Richard D. Irwin Illinois
6. R. G. Brown 1963 Smoothing, Forecasting, and Predicting of Discrete Time Series Prentice-Hall Englewood Cliffs, NJ
7. F. R. Chang 1996 A study of due-date assignment rules with constrained tightness in a dynamic job shop Computers and Industrial Engineering 31 205 208
8. T. C. E. Cheng M. C. Gupta 1989 Survey of scheduling research involving due date determination decisions European Journal of Operational Research 38 156 66
9. R. W. Conway 1965 Priority dispatching and job lateness in a job shop Journal of Industrial Engineering 16 228 237
10. DeWitt, D. J., Katz, R. H., Olken, F., Shapiro, L. D., Stonebraker, M. R. and Wood, D. (1984) Implementation techniques for main memory databases. Proceedings of the ACM SIGMOD International Conference on Management of Data, 1-8
11. I. Duenyas 1995 Single facility due date setting with multiple customer classes Management Science 41 608 619
12. S. E. Eilon I. G. Chowdhury 1976 Due dates in job shop scheduling International Journal of Production Research 14 223 237
13. T. D. Fry P. R. Philipoom R. E. Markland 1989 Due date assignment in a multistage jobshop IIE Transactions 21 153 161
14. H. Garcia-Molina K. Salem 1992 Memory resident database systems: An overview IEEE Transactions on Data and Knowledge Engineering 4 504 519
15. V. Gordon J. Proth C. Chu 2002 A survey of the state-of-the-art of common due date assignment and scheduling research European Journal of Operational Research 39 1 25
16. W. J. Hopp M. L. R. Sturgis 2000 Quoting manufacturing due dates subject to a service level constraint IIE Transactions 32 9 771 784
17. W. J. Hopp M. R. Sturgis 2001 A simple, robust leadtime-quoting policy Manufacturing and Service Operations Management 3 321 336
18. Jagadish, H. V., Seshadri, S., Lieuwen, D., Rastogi, R., Silberschatz, A. and Sudarshan, S. (1994) DALI: A high performance main memory storage manager. Proceedings of the International Conference on Very Large Databases, 48-59
19. J. J. Kanet J. C. Hayya 1982 Priority dispatching with operation due dates in a job shop Journal of Operations Management 2 167 175
20. Lanin, V. and Shasha, D. (1986) A symmetric concurrent B-tree algorithm. Proceedings of the Fall Joint Computer Conference, 380-389
21. K. Law D. Kelton 2000 Simulation Modeling and Analysis McGraw-Hill New York
22. S. R. Lawrence 1995 Estimating flowtimes and setting due-dates in complex production systems IIE Transactions 27 657 658
23. Lehman, T. J. and Carey, M. J. (1986) A study of index structures for main memory database management systems. Proceedings of the Twelfth International Conference on Very Large Data Bases, 294-303
24. J. D. Little 1961 A proof for the queuing formula L = λ W Operations Research 9 383 387
25. P. R. Philipoom L. Wiegmann L. P. Rees 1997 Cost-based due-date assignment with the use of classical and neural-network approaches Naval Research Logistics 44 21 46
26. G. L. Ragatz V. A. Mabert 1984 A simulation analysis of due date assignment rules Journal of Operations Management 5 27 39
27. N. Raman F. B. Talbot 1993 The job shop tardiness problem: A decomposition approach European Journal of Operational Research 69 187 199
28. Rastogi, R., Seshadri, S., Bohannon, P., Leinbaugh, D., Silberschatz, A. and Sudarshan, S. (1997) Logical and physical versioning in main memory databases. Proceedings of the 23rd International Conference on Very Large Databases, 86-95
29. R. Schemener 1988 The merit of making things fast Sloan Management Review 30 11 17
30. M. L. Spearman R. Q. Zhang 1999 Optimal lead time policies Management Science 45 290 295
31. P. Thomas 1991 Getting Competitive: Middle Managers and the Cycle Time Ethic McGraw-Hill New York
32. M. M. Vig K. J. Dooley 1991 Dynamic rules for due-date assignment International Journal of Production Research 29 1361 1377
33. L. M. Wein 1991 Due-date setting and priority sequencing in a multiclass M/G/1 queue Management Science 37 834 850
34. P. Welch 1983 The statistical analysis of simulation results S. Lavenberg The Computer Performance Modeling Handbook Academic Press New York 268 328