{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T01:25:44Z","timestamp":1767144344937,"version":"build-2238731810"},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0166-5316(92)90030-k","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"133-153","source":"Crossref","is-referenced-by-count":3,"title":["A study of a state-dependent job admission policy in a computer system with restricted memory partitions"],"prefix":"10.1016","volume":"15","author":[{"given":"Andr\u00e9B","family":"Bondi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0166-5316(92)90030-K_BIB1","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1287\/opre.37.6.953","article-title":"Monotonicity of the throughput of a closed queueing network in the number of jobs","volume":"37","author":"Adan","year":"1988","journal-title":"Oper. Res."},{"issue":"6","key":"10.1016\/0166-5316(92)90030-K_BIB2","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1287\/opre.21.6.1212","article-title":"Approximate queueing models for multiprogramming computer systems","volume":"21","author":"Avi-Itzhak","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0166-5316(92)90030-K_BIB3","article-title":"Approximate solutions of queueing network models of computer systems","author":"Balbo","year":"1979"},{"issue":"2","key":"10.1016\/0166-5316(92)90030-K_BIB4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321879.321887","article-title":"Open, closed and mixed networks of queues with different classes of customers","volume":"22","author":"Baskett","year":"1975","journal-title":"J. ACM"},{"issue":"9","key":"10.1016\/0166-5316(92)90030-K_BIB5","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/362342.362345","article-title":"Computatonal algorithms for closed queueing networks with exponential servers","volume":"16","author":"Buzen","year":"1973","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0166-5316(92)90030-K_BIB6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/361268.361280","article-title":"A study of storage partitioning using a mathematical model of locality","volume":"15","author":"Coffman","year":"1972","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0166-5316(92)90030-K_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/356733.356735","article-title":"The operational analysis of queueing network models","volume":"10","author":"Denning","year":"1978","journal-title":"Comput. Surveys"},{"issue":"1","key":"10.1016\/0166-5316(92)90030-K_BIB8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TSE.1978.231462","article-title":"Random injection control of multiprogramming in virtual memory","volume":"4","author":"Gelenbe","year":"1978","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0166-5316(92)90030-K_BIB9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1287\/mnsc.10.1.131","article-title":"Jobshop-like queueing networks","volume":"10","author":"Jackson","year":"1963","journal-title":"Manage. Sci."},{"key":"10.1016\/0166-5316(92)90030-K_BIB10","doi-asserted-by":"crossref","first-page":"1623","DOI":"10.1214\/aoms\/1177692394","article-title":"Stochastic order relationships between GI\/G\/k systems","volume":"43","author":"Jacobs","year":"1972","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0166-5316(92)90030-K_BIB11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/nav.3800120206","article-title":"A conservation law for a wide class of queueing systems","volume":"12","author":"Kleinrock","year":"1965","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-5316(92)90030-K_BIB12","author":"Kleinrock","year":"1976"},{"key":"10.1016\/0166-5316(92)90030-K_BIB13","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0207019","article-title":"Finite capacity queueing systems with applications in computer modeling","volume":"7","author":"Konheim","year":"1978","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0166-5316(92)90030-K_BIB14","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1145\/322276.322279","article-title":"Algorithmic analysis of a multiprogramming-multiprocessor computer system","volume":"28","author":"Latouche","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0166-5316(92)90030-K_BIB15","series-title":"Proc. ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems","first-page":"130","article-title":"Multiple class constrained queueing networks","author":"Lazowska","year":"1982"},{"key":"10.1016\/0166-5316(92)90030-K_BIB16","series-title":"Quantitative System Performance: Computer System Analysis Using Queueing Network Models","author":"Lazowska","year":"1984"},{"issue":"3","key":"10.1016\/0166-5316(92)90030-K_BIB17","first-page":"145","article-title":"Operational analysis of multiclass systems with variable multiprogramming level and memory queueing","volume":"3","author":"Menasce","year":"1982","journal-title":"Comput. Performance"},{"key":"10.1016\/0166-5316(92)90030-K_BIB18","series-title":"Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach","author":"Neuts","year":"1981"},{"key":"10.1016\/0166-5316(92)90030-K_BIB19","doi-asserted-by":"crossref","first-page":"221","DOI":"10.2307\/1427244","article-title":"The caudal characteristic curve of queues","volume":"18","author":"Neuts","year":"1986","journal-title":"Adv. in Appl. Probab."},{"key":"10.1016\/0166-5316(92)90030-K_BIB20","series-title":"Introduction to Simulation and SLAM II","author":"Pritsker","year":"1984"},{"issue":"8","key":"10.1016\/0166-5316(92)90030-K_BIB21","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1109\/TCOM.1979.1094531","article-title":"A queueing network analysis of computer communication networks with window flow control","volume":"27","author":"Reiser","year":"1979","journal-title":"IEEE Trans. Comm."},{"issue":"2","key":"10.1016\/0166-5316(92)90030-K_BIB22","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/322186.322195","article-title":"Mean value analysis of closed multichain queueing networks","volume":"27","author":"Reiser","year":"1980","journal-title":"J. ACM"},{"issue":"11","key":"10.1016\/0166-5316(92)90030-K_BIB23","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1109\/T-C.1974.223818","article-title":"A problem in multiprogrammed storage allocation","volume":"23","author":"Ryan","year":"1974","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-5316(92)90030-K_BIB24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/opre.18.1.185","article-title":"An alternative proof of a conservation law for the queue G\/G\/1","volume":"18","author":"Schrage","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/0166-5316(92)90030-K_BIB25","series-title":"Performance of Computer Systems","article-title":"The distribution of queueing network states at input and output instants","author":"Sevcik","year":"1979"},{"key":"10.1016\/0166-5316(92)90030-K_BIB26","doi-asserted-by":"crossref","first-page":"412","DOI":"10.2307\/3214048","article-title":"Stochastic monotonicity in general queueing networks","volume":"26","author":"Shanthikumar","year":"1989","journal-title":"J. Appl. Probab."},{"key":"10.1016\/0166-5316(92)90030-K_BIB27","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/opre.22.2.417","article-title":"A last word on L = \u03bbW","volume":"22","author":"Stidham","year":"1974","journal-title":"Oper. Res."},{"key":"10.1016\/0166-5316(92)90030-K_BIB28","article-title":"Sample path analysis of queues","volume":"Vol. II","author":"Stidham","year":"1982"},{"key":"10.1016\/0166-5316(92)90030-K_BIB29","series-title":"Comparison Methods for Queues and Other Stochastic Models","author":"Stoyan","year":"1983"},{"issue":"4","key":"10.1016\/0166-5316(92)90030-K_BIB30","doi-asserted-by":"crossref","first-page":"884","DOI":"10.2307\/3213363","article-title":"An upper bound for multi-channel queues","volume":"14","author":"Wolff","year":"1977","journal-title":"J. Appl. Probab."}],"updated-by":[{"DOI":"10.1007\/s12190-019-01281-y","type":"retraction","label":"Retraction","source":"publisher","updated":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000}}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016653169290030K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016653169290030K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:58:02Z","timestamp":1551067082000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016653169290030K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["016653169290030K"],"URL":"https:\/\/doi.org\/10.1016\/0166-5316(92)90030-k","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}