{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T04:56:16Z","timestamp":1782622576182,"version":"3.54.5"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,4,15]],"date-time":"2010-04-15T00:00:00Z","timestamp":1271289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10951-010-0174-0","type":"journal-article","created":{"date-parts":[[2010,4,14]],"date-time":"2010-04-14T19:40:24Z","timestamp":1271274024000},"page":"509-529","source":"Crossref","is-referenced-by-count":16,"title":["A fluid approach to large volume job shop scheduling"],"prefix":"10.1007","volume":"13","author":[{"given":"Yoni","family":"Nazarathy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gideon","family":"Weiss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,4,15]]},"reference":[{"key":"174_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391\u2013401.","journal-title":"Management Science"},{"key":"174_CR2","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E. Balas","year":"1968","unstructured":"Balas, E. (1968). Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research, 17, 941\u2013957.","journal-title":"Operations Research"},{"key":"174_CR3","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/moor.6.3.445","volume":"6","author":"I. Barany","year":"1981","unstructured":"Barany, I. (1981). A vector sum theorem and its application to improving flow shop guarantees. Mathematics of Operations Research, 6, 445\u2013452.","journal-title":"Mathematics of Operations Research"},{"key":"174_CR4","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1006\/jagm.1999.1047","volume":"33","author":"D. Bertsimas","year":"1999","unstructured":"Bertsimas, D., & Gamarnik, D. (1999). Asymptotically optimal algorithms for job shop scheduling and packet routing. Journal of Algorithms, 33, 296\u2013318.","journal-title":"Journal of Algorithms"},{"key":"174_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s101070100272","volume":"1","author":"D. Bertsimas","year":"2002","unstructured":"Bertsimas, D., & Sethuraman, J. (2002). From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective. Mathematical Programming, 1, 61\u2013102.","journal-title":"Mathematical Programming"},{"issue":"5","key":"174_CR6","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.51.5.798.16748","volume":"51","author":"D. Bertsimas","year":"2003","unstructured":"Bertsimas, D., Gamarnik, D., & Sethuraman, J. (2003). From fluid relaxations to practical algorithms for job shop scheduling: the holding cost objective. Operations Research, 51(5), 798\u2013813.","journal-title":"Operations Research"},{"key":"174_CR7","unstructured":"Boudoukh, T., Penn, M., & Weiss, G. (1998). Job-shop\u2014an application of fluid approximation. In I.\u00a0Gilad (Ed.), Proceedings of the tenth conference of industrial engineering and management, pp.\u00a0254\u2013258. June 1998, Haifa Israel."},{"key":"174_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/jos.72","volume":"4","author":"T. Boudoukh","year":"2001","unstructured":"Boudoukh, T., Penn, M., & Weiss, G. (2001). Scheduling job shops with some identical or similar jobs. Journal of Scheduling, 4, 177\u2013199.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"174_CR9","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J., & Pinson, E. (1989). An algorithm for solving the job-shop problem. Management Science, 35(2), 164\u2013176.","journal-title":"Management Science"},{"key":"174_CR10","volume-title":"Fundamentals of queuing networks, performance, asymptotics and optimization","author":"H. Chen","year":"2003","unstructured":"Chen, H., & Yao, D. D. (2003). Fundamentals of queuing networks, performance, asymptotics and optimization. New York: Springer."},{"key":"174_CR11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1025130105303","volume":"44","author":"M. Chen","year":"2003","unstructured":"Chen, M., Pandit, C., & Meyn, S. (2003). In search of sensitivity in network optimization. Queuing Systems Theory and Applications, 44, 313\u2013363.","journal-title":"Queuing Systems Theory and Applications"},{"key":"174_CR12","volume-title":"Theory of scheduling","author":"R. W. Conway","year":"1967","unstructured":"Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley."},{"key":"174_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/opre.1040.0170","volume":"53","author":"J. G. Dai","year":"2005","unstructured":"Dai, J. G., & Lin, W. (2005). Maximum pressure policies in stochastic processing networks. Operations Research, 53, 197\u2013218.","journal-title":"Operations Research"},{"key":"174_CR14","doi-asserted-by":"crossref","unstructured":"Dai, J. G., & Lin, W. (2006, submitted). Asymptotic optimality of maximum pressure policies in stochastic processing networks. Annals of Applied Probability.","DOI":"10.1214\/08-AAP522"},{"key":"174_CR15","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.50.4.692.2860","volume":"50","author":"J. B. Dai","year":"2002","unstructured":"Dai, J. B., & Weiss, G. (2002). A fluid heuristic for minimizing makespan in job-shops. Operations Research, 50, 692\u2013707.","journal-title":"Operations Research"},{"key":"174_CR16","unstructured":"Demers, A., Keshav, S., & Shenker, S. (1990). Analysis and simulation of a fair queuing algorithm. Internetworking Research and Experience, 1."},{"key":"174_CR17","unstructured":"Gantt, H. L. (1910) Work, wages and profit. The Engineering Magazine, New York, 1910; republished as Work, wages and profits, Easton, Pennsylvania, Hive Publishing Company, 1974, ISBN 879600489."},{"key":"174_CR18","volume-title":"Computers and intractability: a\u00a0guide to the theory of NP-completeness","author":"M.\u00a0R. Garey","year":"1979","unstructured":"Garey, M.\u00a0R., & Johnson, D. S. (1979). Computers and intractability: a\u00a0guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"174_CR19","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1111\/j.2517-6161.1979.tb01068.x","volume":"14","author":"J. C. Gittins","year":"1979","unstructured":"Gittins, J. C. (1979). Bandit processes and dynamic allocation indices. J Royal Statistical Society Series B, 14, 148\u2013167.","journal-title":"J Royal Statistical Society Series B"},{"key":"174_CR20","volume-title":"The goal: excellence in manufacturing","author":"E. M. Goldratt","year":"1987","unstructured":"Goldratt, E. M., & Cox, J. (1987). The goal: excellence in manufacturing. Croton-on-Hudson: North River Press."},{"key":"174_CR21","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1145\/146637.146658","volume":"39","author":"A. G. Greenberg","year":"1992","unstructured":"Greenberg, A. G., & Madras, N. (1992). How fair is fair queuing? Journal of the Association for Computing Machinery, 39, 568\u2013598.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"174_CR22","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0377-2217(94)90332-8","volume":"72","author":"C. Hanen","year":"1994","unstructured":"Hanen, C. (1994). Study of a NP-hard cyclic scheduling problem: the recurrent job-shop. European Journal of Operational Research, 72, 82\u2013101.","journal-title":"European Journal of Operational Research"},{"key":"174_CR23","volume-title":"Proceedings of the IMA workshop on stochastic differential systems","author":"J. M. Harrison","year":"1988","unstructured":"Harrison, J. M. (1988). Brownian models of queuing networks with heterogeneous customer populations. In W. Fleming, & P. L. Lions (Eds.), Proceedings of the IMA workshop on stochastic differential systems. New York: Springer."},{"key":"174_CR24","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1214\/aoap\/1034801252","volume":"7","author":"J. M. Harrison","year":"1997","unstructured":"Harrison, J. M., & Van Mieghem, J. (1997). Dynamic control of Brownian networks: state space collapse and equivalent workload formulations. Annals of Applied Probability, 7, 747\u2013771.","journal-title":"Annals of Applied Probability"},{"issue":"1\u20132","key":"174_CR25","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1022197004856","volume":"13","author":"S. G. Henderson","year":"2003","unstructured":"Henderson, S. G., Meyn, S. P., & Tadic, V. B. (2003). Performance evaluation and policy selection in multiclass networks. Discrete Event Dynamic Systems, 13(1\u20132), 149\u2013189.","journal-title":"Discrete Event Dynamic Systems"},{"key":"174_CR26","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1287\/opre.39.4.648","volume":"39","author":"D. S. Hochbaum","year":"1991","unstructured":"Hochbaum, D. S., & Shamir, R. (1991). Strongly polynomial algorithms for high multiplicity scheduling problem. Operations Research, 39, 648\u2013653.","journal-title":"Operations Research"},{"key":"174_CR27","unstructured":"Jansen, K., Solis-Oba, R., & Srividenko, M. (2000). Makespan minimization in job shops, a linear time approximation scheme. Preprint, see also preliminary versions in STOC\u201999 and APPROX\u201999."},{"key":"174_CR28","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1137\/1119060","volume":"19","author":"G. P. Klimov","year":"1974","unstructured":"Klimov, G. P. (1974). Time sharing service systems I. Theory of Probability and Applications, 19, 532\u2013551.","journal-title":"Theory of Probability and Applications"},{"key":"174_CR29","unstructured":"Kopzon, A., Nazarathy, Y., & Weiss, G. (2008). A push pull system with infinite supply of work. Preprint."},{"issue":"17","key":"174_CR30","doi-asserted-by":"crossref","first-page":"3949","DOI":"10.1080\/00207540600791608","volume":"45","author":"O. Kulak","year":"2007","unstructured":"Kulak, O., Yilmaz, I. O., & G\u016dnther, H. O. (2007). PCB assembly scheduling for collect-and-place machines using genetic algorithms. International Journal of Production Research, 45(17), 3949\u20133969.","journal-title":"International Journal of Production Research"},{"key":"174_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0005-2","volume-title":"Heavy traffic analysis of controlled queuing and communication networks","author":"H. J. Kushner","year":"2001","unstructured":"Kushner, H. J. (2001). Heavy traffic analysis of controlled queuing and communication networks. Berlin: Springer."},{"key":"174_CR32","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1137\/0328056","volume":"28","author":"H. J. Kushner","year":"1990","unstructured":"Kushner, H. J., & Martins, L. F. (1990). Routing and singular control for queuing networks in heavy traffic. SIAM Journal on Control and Optimization, 28, 1209\u20131233.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"174_CR33","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1137\/0327066","volume":"27","author":"H. J. Kushner","year":"1989","unstructured":"Kushner, H. J., & Ramachandran, K. M. (1989). Optimal and approximately optimal control policies for queues in heavy traffic. SIAM Journal on Control and Optimization, 27, 1293\u20131318.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"174_CR34","volume-title":"Sequencing and scheduling: algorithms and complexity, in logistics of production and inventory","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnoy Kan, A. H. G., & Shmoys, D. B. (1993). In S. C. Graves, A. H. G. Rinnoy Kan, & P. H. Zipkin (Eds.), Sequencing and scheduling: algorithms and complexity, in logistics of production and inventory. New York: Elsevier Science."},{"key":"174_CR35","doi-asserted-by":"crossref","unstructured":"Martin, P., & Shmoys, D. B. (1996). A new approach to computing optimal schedules for the job-shop scheduling problem. In International IPCO conference (pp. 389\u2013403).","DOI":"10.1007\/3-540-61310-2_29"},{"key":"174_CR36","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1002\/1520-6750(199010)37:5<679::AID-NAV3220370507>3.0.CO;2-Q","volume":"37","author":"H. Matsuo","year":"1990","unstructured":"Matsuo, H. (1990). Cyclic sequencing problems in the two-machine permutation flow shop: complexity, worst-case and average-case analysis. Naval Research Logistics, 37, 679\u2013694.","journal-title":"Naval Research Logistics"},{"key":"174_CR37","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"S. T. McCormick","year":"1989","unstructured":"McCormick, S. T., Pinedo, M. L., Shenker, S., & Wolf, B. (1989). Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37, 925\u2013935.","journal-title":"Operations Research"},{"key":"174_CR38","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1137\/S0363012999362724","volume":"40","author":"S. P. Meyn","year":"2001","unstructured":"Meyn, S. P. (2001). Sequencing and routing in multiclass queuing networks, part I: feedback regulation. SIAM Journal on Control and Optimization, 40, 741\u2013776. IEEE International Symposium on Information Theory, Sorrento, Italy, June 25\u2013June 30, 2000.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"174_CR39","volume-title":"Control techniques for complex networks","author":"S. P. Meyn","year":"2008","unstructured":"Meyn, S. P. (2008). Control techniques for complex networks. Cambridge: Cambridge University Press."},{"key":"174_CR40","unstructured":"Moallemi, C. C., Kumar, S., & Van Roy, B. (2008). Approximate and data-driven dynamic programming for queuing networks."},{"key":"174_CR41","volume-title":"Industrial scheduling","author":"J. F. Muth","year":"1954","unstructured":"Muth, J. F., & Thompson, G. L. (1954). Industrial scheduling. Prentice-Hall: Englewood Cliffs."},{"key":"174_CR42","unstructured":"Nazarathy, Y. (2001). Evaluation of on line scheduling rules for high volume job shop problems: a simulation study. MA thesis, The University of Haifa, Israel."},{"key":"174_CR43","unstructured":"Nazarathy, Y., & Weiss, G. (2008). Positive Harris recurrence and diffusion scale analysis of a push pull queuing network. Preprint."},{"key":"174_CR44","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10479-008-0443-x","volume":"170","author":"Y. Nazarathy","year":"2009","unstructured":"Nazarathy, Y., & Weiss, G. (2009). Near optimal control of queuing networks over a finite time horizon. Annals of Operations Research, 170, 233\u2013249.","journal-title":"Annals of Operations Research"},{"key":"174_CR45","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1017\/S0001867800010648","volume":"33","author":"J. Ni-o-Mora","year":"2001","unstructured":"Ni-o-Mora, J. (2001). Restless bandits, partial conservation laws and indexability. Advances in Applied Probability, 33, 76\u201398.","journal-title":"Advances in Applied Probability"},{"key":"174_CR46","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10107-002-0362-6","volume":"93","author":"J. Ni-o-Mora","year":"2002","unstructured":"Ni-o-Mora, J. (2002). Dynamic allocation indices for restless projects and queuing admission control: a polyhedral approach. Mathematical Programming, Series A, 93, 361\u2013413.","journal-title":"Mathematical Programming, Series A"},{"key":"174_CR47","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/moor.1050.0165","volume":"31","author":"J. Ni-o-Mora","year":"2006","unstructured":"Ni-o-Mora, J. (2006). Restless bandit marginal productivity indices, diminishing returns and optimal control of make-to-order\/make-to-stock M\/G\/1 queues. Mathematics of Operations Research, 31, 50\u201384.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"174_CR48","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1287\/moor.24.2.293","volume":"24","author":"C. H. Papadimitriou","year":"1999","unstructured":"Papadimitriou, C. H., & Tsitsiklis, J. N. (1999). The complexity of optimal queuing network control. Mathematics of Operations Research, 24(2), 293\u2013305.","journal-title":"Mathematics of Operations Research"},{"key":"174_CR49","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/90.234856","volume":"1","author":"A. K. Parekh","year":"1993","unstructured":"Parekh, A. K., & Gallager, R. G. (1993). A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE\/ACM Transactions on Networking, 1, 344\u2013357.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"174_CR50","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/90.298432","volume":"2","author":"A. K. Parekh","year":"1994","unstructured":"Parekh, A. K., & Gallager, R. G. (1994). A generalized processor sharing approach to flow control in integrated services networks: the multiple-node case. IEEE\/ACM Transactions on Networking, 2, 137\u2013150.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"174_CR51","volume-title":"Scheduling, theory, algorithms and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling, theory, algorithms and systems (3rd edn.). New York: Springer.","edition":"3"},{"key":"174_CR52","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/moor.17.4.842","volume":"17","author":"R. Roundy","year":"1992","unstructured":"Roundy, R. (1992). Cyclic scheduling for job shops with identical jobs. Mathematics of Operations Research, 17, 842\u2013865.","journal-title":"Mathematics of Operations Research"},{"key":"174_CR53","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1007\/BF01068694","volume":"22","author":"S. V. Sevastyanov","year":"1987","unstructured":"Sevastyanov, S. V. (1987). Bounding algorithm for the routing problem with arbitrary paths and alternative servers. Cybernetics, 22, 773\u2013781.","journal-title":"Cybernetics"},{"key":"174_CR54","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(94)90036-1","volume":"55","author":"S. V. Sevastyanov","year":"1994","unstructured":"Sevastyanov, S. V. (1994). On some geometric methods in scheduling theory, a survey. Discrete Applied Mathematics, 55, 59\u201382.","journal-title":"Discrete Applied Mathematics"},{"key":"174_CR55","first-page":"191","volume":"82","author":"S. V. Sevastyanov","year":"1998","unstructured":"Sevastyanov, S. V., & Woeginger, G. J. (1998). Makespan minimization in open shops, a polynomial type approximation scheme. Mathematical Programming, 82, 191\u2013198.","journal-title":"Mathematical Programming"},{"key":"174_CR56","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S009753979222676X","volume":"23","author":"D. B. Shmoys","year":"1994","unstructured":"Shmoys, D. B., Stein, C., & Wein, J. (1994). Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing, 23, 617\u2013632.","journal-title":"SIAM Journal on Computing"},{"key":"174_CR57","volume-title":"Data and computer communications","author":"W. Stallings","year":"2007","unstructured":"Stallings, W. (2007). Data and computer communications (8th edn.). Upper Saddle River: Prentice-Hall.","edition":"8"},{"key":"174_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aoap\/1075828046","volume":"14","author":"A. L. Stolyar","year":"2004","unstructured":"Stolyar, A. L. (2004). MaxWeight scheduling in a generalized switch: state space collapse and equivalent workload minimization under complete resource pooling. Annals of Probability, 14, 1\u201353.","journal-title":"Annals of Probability"},{"key":"174_CR59","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"R. H. Storer","year":"1992","unstructured":"Storer, R. H., Wu, S. D., & Vaccari, R. (1992). New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38, 1495\u20131509.","journal-title":"Management Science"},{"key":"174_CR60","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/9.341781","volume":"40","author":"L. Tassiulas","year":"1995","unstructured":"Tassiulas, L. (1995). Adaptive back-pressure congestion control based on local information. IEEE Transactions on Automatic Control, 40, 236\u2013250.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"174_CR61","volume-title":"Microchip fabrication","author":"P. Zant Van","year":"2004","unstructured":"Van Zant, P. (2004). Microchip fabrication (5th edn.). New York: McGraw-Hill.","edition":"5"},{"key":"174_CR62","unstructured":"Veatch, M. H. (2005). Approximate dynamic programming for networks: fluid models and constraint reduction. Preprint."},{"key":"174_CR63","doi-asserted-by":"crossref","first-page":"S312","DOI":"10.1287\/opre.40.3.S312","volume":"40","author":"L. M. Wein","year":"1992","unstructured":"Wein, L. M. (1992). Scheduling networks of queues: heavy traffic analysis of a multistation network with controllable inputs. Operations Research, 40, S312\u2013S334.","journal-title":"Operations Research"},{"key":"174_CR64","series-title":"IMA volumes in mathematics and its applications","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-1-4757-2418-9_4","volume-title":"Stochastic networks, proceedings of ima workshop","author":"G. Weiss","year":"1995","unstructured":"Weiss, G. (1995). On the optimal draining of a fluid re-entrant line. In F. P. Kelly, & R. Williams (Eds.), IMA volumes in mathematics and its applications : Vol. 71. Stochastic networks, proceedings of ima workshop, Minnesota, February 1994 (pp. 91\u2013104). New York: Springer."},{"key":"174_CR65","unstructured":"Weiss, G. (1999). Scheduling and control of manufacturing systems\u2014a fluid approach. In Proceedings of the 37th allerton conference, (pp. 577\u2013586), Monticello, IL, 21\u201324 September 1999."},{"key":"174_CR66","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1239\/jap\/1127322036","volume":"42","author":"G. Weiss","year":"2005","unstructured":"Weiss, G. (2005). Jackson networks with unlimited supply of work and full utilization. Journal of Applied Probability, 42, 879\u2013882.","journal-title":"Journal of Applied Probability"},{"key":"174_CR67","first-page":"287","volume":"25A","author":"P. Whittle","year":"1981","unstructured":"Whittle, P. (1981). Restless bandits: activity allocation in a changing world. Journal of Applied Probability 25A, 287\u2013298.","journal-title":"Journal of Applied Probability"},{"key":"174_CR68","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"D. P. Williamson","year":"1997","unstructured":"Williamson, D. P., Hall, L. A., Hoogeveen, J. A., Hurkens, C. A. J., Lenstra, J. K., Sevast\u2019ynaov, S. V., & Shmoys, D. B. (1997). Short shop schedules. Operations Research, 45, 288\u2013294.","journal-title":"Operations Research"},{"key":"174_CR69","doi-asserted-by":"crossref","unstructured":"Zhang, H. (1995). Service disciplines for guaranteed performance service in packet-switching networks. In Proceedings of the IEEE, October 1995.","DOI":"10.1109\/5.469298"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0174-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0174-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0174-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T00:36:44Z","timestamp":1740011804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0174-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,15]]},"references-count":69,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["174"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0174-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,15]]}}}