{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:49:43Z","timestamp":1761486583297},"reference-count":41,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0305-0548(97)00011-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"1063-1073","source":"Crossref","is-referenced-by-count":3,"title":["An aggregation procedure for simulating manufacturing flow line models"],"prefix":"10.1016","volume":"24","author":[{"given":"Paul A.","family":"Savory","sequence":"first","affiliation":[]},{"given":"Gerald T.","family":"Mackulak","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00011-7_BIB1","series-title":"Introduction to Simulation Using SIMAN","author":"Pegden","year":"1995"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB2","series-title":"SCS 1986 Winter Simulation Conference","first-page":"129","article-title":"Hierarchical modular modeling\/knowledge representation","author":"Zeigler","year":"1986"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1177\/003754978704900506","article-title":"Hierarchical, modular discrete-event modelling in an object-oriented environment","volume":"49","author":"Zeigler","year":"1987","journal-title":"Simulation"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB4","series-title":"SCS 1987 Winter Simulation Conference","first-page":"544","article-title":"Implementing the product automaton formalism","author":"Portier","year":"1987"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/2786.2792","article-title":"A specification language to assist in analysis of discrete event simulation models","volume":"28","author":"Overstreet","year":"1985","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB6","series-title":"SCS 1989 Winter Simulation Conference","first-page":"711","article-title":"A comparison of selected conceptual frameworks for simulation modeling","author":"Derrick","year":"1989"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB7","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.39.4.553","article-title":"Aggregation and disaggregation techniques and methodology in optimization","volume":"39","author":"Rogers","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/opre.13.1.121","article-title":"Reduction methods for tandem queuing systems","volume":"13","author":"Friedman","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1287\/opre.35.2.291","article-title":"An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking","volume":"35","author":"Gershwin","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB10","series-title":"Queueing Networks with Blocking","first-page":"127","article-title":"An efficient decomposition algorithm for unreliable tandem queueing systems with finite buffers","author":"Gershwin","year":"1989"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB11","series-title":"Queueing Networks with Blocking","first-page":"33","article-title":"Aggregate approximation for acyclic queueing networks with communication blocking","author":"Takahashi","year":"1989"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB12","series-title":"Queueing Networks with Blocking","first-page":"47","article-title":"Aggregate modelling of tandem queues without intermediate buffers","author":"Schweitzer","year":"1989"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB13","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/opre.4.6.674","article-title":"Sequential arrays of waiting lines","volume":"4","author":"Hunt","year":"1956","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB14","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/opre.15.2.286","article-title":"Finite queues in series with exponential or Erlang service times \u2014 A numerical approach","volume":"15","author":"Hillier","year":"1967","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB15","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/0377-2217(82)90204-1","article-title":"Approximate analysis of exponential tandem queues and blocking","volume":"11","author":"Altiok","year":"1982","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB16","series-title":"Queueing Networks with Blocking","first-page":"147","article-title":"An approximation method for general tandem queueing systems subject to blocking","author":"Gun","year":"1989"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB17","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1080\/00207549008942799","article-title":"Analysis of material flow in a job shop with assembly operations","volume":"28","author":"Cheng","year":"1990","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB18","first-page":"38","article-title":"Developing a strategy for justifying simulation","volume":"24","author":"Mott","year":"1992","journal-title":"Industrial Engineering"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB19","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1080\/00207548408942454","article-title":"A comprehensive flowline classification scheme","volume":"22","author":"Aneke","year":"1984","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB20","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1287\/opre.37.4.601","article-title":"Approximate analysis of queues in series with phase-type service time and blocking","volume":"37","author":"Altiok","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/opre.36.1.73","article-title":"An approximation method for tandem queues with blocking","volume":"36","author":"Brandwajin","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB22","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1287\/opre.34.4.522","article-title":"A tactical planning model for a job shop","volume":"34","author":"Graves","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB23","first-page":"651","article-title":"The effect of some design factors on the efficiency of production lines with variable operation times","volume":"17","author":"Hillier","year":"1966","journal-title":"Journal of Industrial Engineering"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.15807\/jorsj.27.191","article-title":"Relationship between time\/customer stationary characteristics of tandem queues attended by a single server","volume":"27","author":"Konig","year":"1984","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB25","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.34.1.130","article-title":"On Johnson's two-machine flow shop with random processing times","volume":"34","author":"Ku","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB26","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1287\/opre.40.6.1139","article-title":"The output processes of serial production lines of exponential machines with finite queues","volume":"40","author":"Hendricks","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB27","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1287\/opre.40.5.936","article-title":"Tandem queues with planned inventories","volume":"40","author":"Lee","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB28","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1287\/mnsc.19.6.703","article-title":"Approximations formulae for estimation of waiting-time in multiple-channel queueing system","volume":"19","author":"Maaloe","year":"1973","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB29","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1287\/opre.37.6.925","article-title":"Sequencing in an assembly line with blocking to minimize cycle time","volume":"37","author":"McCormick","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB30","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/opre.30.1.148","article-title":"Minimizing the expected makespan in stochastic flow shops","volume":"30","author":"Pinedo","year":"1982","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB31","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1287\/opre.32.4.753","article-title":"A tandem network of queues with deterministic service and intermediate arrivals","volume":"32","author":"Shalmon","year":"1984","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB32","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1287\/mnsc.36.9.1080","article-title":"Arranging queues in series: A simulation experiment","volume":"36","author":"Suresh","year":"1990","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB33","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/opre.36.3.445","article-title":"An adaptive scheduling algorithm for flexible flow lines","volume":"36","author":"Wittrock","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB34","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0167-6377(83)90026-3","article-title":"Comparison conjectures about the M\/G\/S queue","volume":"2","author":"Whitt","year":"1983","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB35","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1287\/moor.9.4.534","article-title":"Departures from a queue with many busy servers","volume":"9","author":"Whitt","year":"1984","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB36","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1287\/opre.30.4.619","article-title":"Tandem queues with dependent service times in light traffic","volume":"30","author":"Wolff","year":"1982","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB37","article-title":"A robust aggregation approach to simplification of manufacturing flow line models","author":"Savory","year":"1993"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB38","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.4.6.699","article-title":"The output of a queueing systems","volume":"4","author":"Burke","year":"1956","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB39","series-title":"Introduction to Simulation and Slam II","author":"Pritsker","year":"1986"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB40","doi-asserted-by":"crossref","first-page":"214","DOI":"10.2307\/2683739","article-title":"On the alias method for generating random variables from a discrete distribution","volume":"33","author":"Kronmal","year":"1979","journal-title":"The American Statistician"},{"key":"10.1016\/S0305-0548(97)00011-7_BIB41","series-title":"Simulation Modeling and Analysis","author":"Law","year":"1991"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000117?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000117?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T02:28:40Z","timestamp":1555986520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":41,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0305054897000117"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00011-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}