Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

This paper analyzes the scalability and performance of computational structures used in an order promising method designed for discrete build-to-order environments facing dynamic order arrivals. Main-memory database technology and supporting index structures are exploited to improve scalability of this data-intensive procedure so that orders can be promised in real time for industrial-sized systems. Two index structures, a linear structure and a tree structure, are compared. The tree structure improves response times and also has higher scalability at the expense of larger memory requirements compared to the linear structure. Performance of the method is evaluated under two manufacturing scenarios: a tandem line and an assembly shop. Computational results obtained from large-scale simulation studies of realistic systems with 60 resources show the method to be robust. Accuracy of the method in terms of median absolute lateness surpasses that of due date assignment methods previously examined in the literature.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • N. R. Adam J. W. M. Bertrand D. C. Morehead J. Surkis (1993) ArticleTitleDue date assignment procedures with dynamically updated coefficients for multi-level assembly job shops European Journal of Operational Research 68 212–227

    Google Scholar 

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

  • K. R. Baker J. W. M. Bertrand (1981) ArticleTitleAn investigation of due-date assignment rules with constrained tightness Journal of Operations Management 1 109–120

    Google Scholar 

  • J. W. M. Bertrand (1983) ArticleTitleThe effect of workload dependent due-dates on job shop performance Management Science 29 799–816

    Google Scholar 

  • J. Blackburn (1991) Time Based Competition Richard D. Irwin Illinois

    Google Scholar 

  • R. G. Brown (1963) Smoothing, Forecasting, and Predicting of Discrete Time Series Prentice-Hall Englewood Cliffs, NJ

    Google Scholar 

  • F. R. Chang (1996) ArticleTitleA study of due-date assignment rules with constrained tightness in a dynamic job shop Computers and Industrial Engineering 31 205–208

    Google Scholar 

  • T. C. E. Cheng M. C. Gupta (1989) ArticleTitleSurvey of scheduling research involving due date determination decisions European Journal of Operational Research 38 156–66

    Google Scholar 

  • R. W. Conway (1965) ArticleTitlePriority dispatching and job lateness in a job shop Journal of Industrial Engineering 16 228–237

    Google Scholar 

  • 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

  • I. Duenyas (1995) ArticleTitleSingle facility due date setting with multiple customer classes Management Science 41 608–619

    Google Scholar 

  • S. E. Eilon I. G. Chowdhury (1976) ArticleTitleDue dates in job shop scheduling International Journal of Production Research 14 223–237

    Google Scholar 

  • T. D. Fry P. R. Philipoom R. E. Markland (1989) ArticleTitleDue date assignment in a multistage jobshop IIE Transactions 21 153–161

    Google Scholar 

  • H. Garcia-Molina K. Salem (1992) ArticleTitleMemory resident database systems: An overview IEEE Transactions on Data and Knowledge Engineering 4 504–519

    Google Scholar 

  • V. Gordon J. Proth C. Chu (2002) ArticleTitleA survey of the state-of-the-art of common due date assignment and scheduling research European Journal of Operational Research 39 1–25

    Google Scholar 

  • W. J. Hopp M. L. R. Sturgis (2000) ArticleTitleQuoting manufacturing due dates subject to a service level constraint IIE Transactions 32 IssueID9 771–784

    Google Scholar 

  • W. J. Hopp M. R. Sturgis (2001) ArticleTitleA simple, robust leadtime-quoting policy Manufacturing and Service Operations Management 3 321–336

    Google Scholar 

  • 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

  • J. J. Kanet J. C. Hayya (1982) ArticleTitlePriority dispatching with operation due dates in a job shop Journal of Operations Management 2 167–175

    Google Scholar 

  • Lanin, V. and Shasha, D. (1986) A symmetric concurrent B-tree algorithm. Proceedings of the Fall Joint Computer Conference, 380–389

  • K. Law D. Kelton (2000) Simulation Modeling and Analysis McGraw-Hill New York

    Google Scholar 

  • S. R. Lawrence (1995) ArticleTitleEstimating flowtimes and setting due-dates in complex production systems IIE Transactions 27 657–658

    Google Scholar 

  • 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

  • J. D. Little (1961) ArticleTitleA proof for the queuing formula L = λ W Operations Research 9 383–387

    Google Scholar 

  • P. R. Philipoom L. Wiegmann L. P. Rees (1997) ArticleTitleCost-based due-date assignment with the use of classical and neural-network approaches Naval Research Logistics 44 21–46

    Google Scholar 

  • G. L. Ragatz V. A. Mabert (1984) ArticleTitleA simulation analysis of due date assignment rules Journal of Operations Management 5 27–39

    Google Scholar 

  • N. Raman F. B. Talbot (1993) ArticleTitleThe job shop tardiness problem: A decomposition approach European Journal of Operational Research 69 187–199

    Google Scholar 

  • 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

  • R. Schemener (1988) ArticleTitleThe merit of making things fast Sloan Management Review 30 11–17

    Google Scholar 

  • M. L. Spearman R. Q. Zhang (1999) ArticleTitleOptimal lead time policies Management Science 45 290–295

    Google Scholar 

  • P. Thomas (1991) Getting Competitive: Middle Managers and the Cycle Time Ethic McGraw-Hill New York

    Google Scholar 

  • M. M. Vig K. J. Dooley (1991) ArticleTitleDynamic rules for due-date assignment International Journal of Production Research 29 1361–1377

    Google Scholar 

  • L. M. Wein (1991) ArticleTitleDue-date setting and priority sequencing in a multiclass M/G/1 queue Management Science 37 834–850

    Google Scholar 

  • P. Welch (1983) The statistical analysis of simulation results S. Lavenberg (Eds) The Computer Performance Modeling Handbook Academic Press New York 268–328

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Industrial Engineering, University of Oklahoma, 202 W. Boyd Street, Room 124, Norman, OK, 73019, USA

    Andres J. Lucas & Scotta A. Moses

Authors
  1. Andres J. Lucas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Scotta A. Moses
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Scotta A. Moses.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lucas, A.J., Moses, S.A. Scalability and performance of computational structures for real-time order promising. J Intell Manuf 16, 5–20 (2005). https://doi.org/10.1007/s10845-005-4821-9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-005-4821-9

Keywords

Search

Navigation