{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:26:10Z","timestamp":1726413970328},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,2,24]],"date-time":"2009-02-24T00:00:00Z","timestamp":1235433600000},"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":[[2009,8]]},"DOI":"10.1007\/s10951-009-0103-2","type":"journal-article","created":{"date-parts":[[2009,2,23]],"date-time":"2009-02-23T15:30:17Z","timestamp":1235403017000},"page":"375-388","source":"Crossref","is-referenced-by-count":6,"title":["Stochastic scheduling on parallel machines to minimize discounted holding costs"],"prefix":"10.1007","volume":"12","author":[{"given":"Xiaoqiang","family":"Cai","sequence":"first","affiliation":[]},{"given":"Xianyi","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xian","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,24]]},"reference":[{"issue":"5","key":"103_CR1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1002\/1520-6750(199408)41:5<677::AID-NAV3220410509>3.0.CO;2-7","volume":"41","author":"A. Allahverdi","year":"1994","unstructured":"Allahverdi, A., & Mittenthal, J. (1994). Scheduling on Mparallel machines subject to random breakdowns to minimize expected mean flow time. Naval Research Logistics, 41(5), 677\u2013682.","journal-title":"Naval Research Logistics"},{"issue":"1","key":"103_CR2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.ijpe.2008.04.011","volume":"115","author":"D. Biskup","year":"2008","unstructured":"Biskup, D., Herrmann, J., & Gupta, J. N. D. (2008). Scheduling identical parallel machines to minimize total tardiness. International Journal of Production Economics, 115(1), 134\u2013142.","journal-title":"International Journal of Production Economics"},{"key":"103_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00264227","volume":"22","author":"J. Bruno","year":"1985","unstructured":"Bruno, J. (1985). On scheduling tasks with exponential service times and in-tree precedence constraints. Acta Informatica, 22, 139\u2013148.","journal-title":"Acta Informatica"},{"key":"103_CR4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.47.3.422","volume":"47","author":"X. Q. Cai","year":"1999","unstructured":"Cai, X. Q., & Zhou, X. (1999). Stochastic scheduling on parallel machine subject to random breakdowns to minimize expected costs for earliness and tardy cost. Operations Research, 47, 422\u2013437.","journal-title":"Operations Research"},{"key":"103_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1019220826984","volume":"98","author":"X. Q. Cai","year":"2000","unstructured":"Cai, X. Q., & Zhou, X. (2000). Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine. Annals of Operations Research, 98, 313\u2013331.","journal-title":"Annals of Operations Research"},{"key":"103_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10898-004-5702-z","volume":"31","author":"X. Q. Cai","year":"2005","unstructured":"Cai, X. Q., & Zhou, X. (2005). Single-machine scheduling with exponential processing times and general stochastic cost functions. Journal of Global Optimization, 31, 317\u2013332.","journal-title":"Journal of Global Optimization"},{"key":"103_CR7","first-page":"21","volume-title":"Handbook of combinatorial optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C. N., & Woeginger, G. (1998). A review of machine scheduling: Complexity, algorithms and approximability. In D.-Z. Du P. M. Pardalos (Eds.), Handbook of combinatorial optimization (pp. 21\u2013169). Dordrecht: Kluwer."},{"key":"103_CR8","doi-asserted-by":"crossref","first-page":"667","DOI":"10.2307\/3214903","volume":"29","author":"C. S. Chang","year":"1992","unstructured":"Chang, C. S., Chao, X., Pinedo, M., & Weber, R. (1992). On the optimality of LEPT and c \u03bc rules for machines in parallel. Journal of Applied Probability, 29, 667\u2013681.","journal-title":"Journal of Applied Probability"},{"key":"103_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-2434-0","volume-title":"Non-additive measure and integral","author":"D. Denneberg","year":"1994","unstructured":"Denneberg, D. (1994). Non-additive measure and integral. Dordrecht: Kluwer Academic."},{"key":"103_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/A:1017948530608","volume":"40","author":"M. J. Dacre","year":"2002","unstructured":"Dacre, M. J., & Glazebrook, K. D. (2002). The dependence of optimal returns from multi-class queuing systems on their customer base. Queuing Systems. Theory and Applications, 40, 93\u2013115.","journal-title":"Queuing Systems. Theory and Applications"},{"issue":"2","key":"103_CR11","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1017\/S0001867800010843","volume":"33","author":"R. T. Dunn","year":"2001","unstructured":"Dunn, R. T., & Glazebrook, K. D. (2001). The performance of index-based policies for bandit problems with stochastic machine availability. Advances in Applied Probability, 33(2), 365\u2013390.","journal-title":"Advances in Applied Probability"},{"issue":"2","key":"103_CR12","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/moor.1030.0068","volume":"29","author":"R. T. Dunn","year":"2004","unstructured":"Dunn, R. T., & Glazebrook, K. D. (2004). Discounted multiarmed bandit problems on a collection of machines with varying speeds. Mathematics of Operations Research, 29(2), 266\u2013279.","journal-title":"Mathematics of Operations Research"},{"key":"103_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.2307\/3213196","volume":"18","author":"J. C. Gittins","year":"1981","unstructured":"Gittins, J. C. (1981). Multiserver scheduling of jobs with increasing completion rates. Journal of Applied Probability, 18, 321\u2013324.","journal-title":"Journal of Applied Probability"},{"key":"103_CR14","doi-asserted-by":"crossref","first-page":"685","DOI":"10.2307\/3213099","volume":"16","author":"K. D. Glazebrook","year":"1979","unstructured":"Glazebrook, K. D. (1979). Scheduling tasks with exponential service times on parallel processors. Journal of Applied Probability, 16, 685\u2013689.","journal-title":"Journal of Applied Probability"},{"key":"103_CR15","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1966","unstructured":"Graham, R. L. (1966). Bounds for certain multiprocessing anomalities. Bell System Technical Journal, 45, 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"key":"103_CR16","doi-asserted-by":"crossref","first-page":"979","DOI":"10.2307\/1427802","volume":"25","author":"A. Hordijk","year":"1993","unstructured":"Hordijk, A., & Koole, G. (1993). On the optimality of lept and \u03bc c rules for parallel processors and dependent arrival processes. Advances in Applied Probability, 25, 979\u2013996.","journal-title":"Advances in Applied Probability"},{"key":"103_CR17","doi-asserted-by":"crossref","first-page":"430","DOI":"10.2307\/3214267","volume":"24","author":"T. K\u00e4mpke","year":"1987","unstructured":"K\u00e4mpke, T. (1987a). On the optimality of static priority policies in stochastic scheduling on parallel machines. Journal of Applied Probability, 24, 430\u2013448.","journal-title":"Journal of Applied Probability"},{"issue":"3","key":"103_CR18","doi-asserted-by":"crossref","first-page":"749","DOI":"10.2307\/1427418","volume":"19","author":"T. K\u00e4mpke","year":"1987","unstructured":"K\u00e4mpke, T. (1987b). Necessary optimality conditions for priority policies in stochastic weighted flowtime scheduling problems. Advances in Applied Probability, 19(3), 749\u2013750.","journal-title":"Advances in Applied Probability"},{"key":"103_CR19","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/opre.37.1.126","volume":"37","author":"T. K\u00e4mpke","year":"1989","unstructured":"K\u00e4mpke, T. (1989). Optimal scheduling of jobs with exponential service times on identical parallel processors. Operations Research, 37, 126\u2013133.","journal-title":"Operations Research"},{"key":"103_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0216001","volume":"16","author":"C. H. Papadimitriou","year":"1987","unstructured":"Papadimitriou, C. H., & Tsitsiklis, J. N. (1987). On stochastic scheduling with in-tree precedence constraints. SIAM Journal of Computing, 16, 1\u20136.","journal-title":"SIAM Journal of Computing"},{"key":"103_CR21","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1287\/opre.31.3.559","volume":"31","author":"M. Pinedo","year":"1983","unstructured":"Pinedo, M. (1983). Stochastic scheduling with release dates and due dates. Operations Research, 31, 559\u2013572.","journal-title":"Operations Research"},{"key":"103_CR22","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling: theory, algorithms, and systems (2nd ed.). New York: Prentice-Hall.","edition":"2"},{"issue":"4","key":"103_CR23","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0167-6911(88)90009-6","volume":"10","author":"R. Righter","year":"1988","unstructured":"Righter, R. (1988). Job scheduling to minimize expected weighted flowtime on uniform processors. Systems and Control Letters, 10(4), 211\u2013216.","journal-title":"Systems and Control Letters"},{"key":"103_CR24","doi-asserted-by":"crossref","first-page":"909","DOI":"10.2307\/1427683","volume":"23","author":"R. Righter","year":"1991","unstructured":"Righter, R., & Xu, S. H. (1991). Scheduling jobs on nonidentical IFR processors to minimize general cost functions. Advances in Applied Probability, 23, 909\u2013924.","journal-title":"Advances in Applied Probability"},{"key":"103_CR25","volume-title":"Introduction to stochastic dynamic programming","author":"S. Ross","year":"1983","unstructured":"Ross, S. (1983). Introduction to stochastic dynamic programming. New York: Academic Press."},{"issue":"1","key":"103_CR26","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s00186-007-0150-4","volume":"66","author":"K. Schiefermayr","year":"2007","unstructured":"Schiefermayr, K., & Weichbold, J. (2007). A scheduling problem for several parallel servers. Mathematical Methods of Operations Research, 66(1), 127\u2013148.","journal-title":"Mathematical Methods of Operations Research"},{"key":"103_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0925-5273(02)00265-7","volume":"83","author":"T. Sen","year":"2003","unstructured":"Sen, T., Sulek, J. M., & Dileepan, P. (2003). Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey. International Journal of Production Economics, 83, 1\u201312.","journal-title":"International Journal of Production Economics"},{"key":"103_CR28","doi-asserted-by":"crossref","first-page":"167","DOI":"10.2307\/3213926","volume":"19","author":"R. R. Weber","year":"1982","unstructured":"Weber, R. R. (1982). Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime. Journal of Applied Probability, 19, 167\u2013182.","journal-title":"Journal of Applied Probability"},{"key":"103_CR29","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/978-1-4613-8762-6_34","volume-title":"Stochastic differential systems, stochastic control theory and applications","author":"R. R. Weber","year":"1988","unstructured":"Weber, R. R. (1988). Stochastic scheduling on parallel processors and minimization of concave functions of completion times. In W. Fleming& P. L. Lions (Eds.), Stochastic differential systems, stochastic control theory and applications (Vol.\u00a010, pp. 601\u2013609). New York: Springer."},{"key":"103_CR30","doi-asserted-by":"crossref","first-page":"841","DOI":"10.2307\/3214023","volume":"23","author":"R. R. Weber","year":"1986","unstructured":"Weber, R. R., Varaiya, P., & Walrand, J. (1986). Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime. Journal of Applied Probability, 23, 841\u2013847.","journal-title":"Journal of Applied Probability"},{"key":"103_CR31","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1002\/nav.3800310309","volume":"31","author":"G. Weiss","year":"1984","unstructured":"Weiss, G. (1984). Scheduling spares with exponential lifetimes in a two component parallel system. Naval Logistics Research Quarterly, 31, 431\u2013446.","journal-title":"Naval Logistics Research Quarterly"},{"key":"103_CR32","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02248591","volume":"26","author":"G. Weiss","year":"1990","unstructured":"Weiss, G. (1990). Approximation results in parallel machines stochastic scheduling. Annals of Operations Research, 26, 195\u2013242.","journal-title":"Annals of Operations Research"},{"key":"103_CR33","doi-asserted-by":"crossref","first-page":"187","DOI":"10.2307\/3212936","volume":"17","author":"G. Weiss","year":"1980","unstructured":"Weiss, G., & Pinedo, M. (1980). Scheduling tasks with exponential service times on nonidentical processors to minimize various cost functions. Journal of Applied Probability, 17, 187\u2013202.","journal-title":"Journal of Applied Probability"},{"key":"103_CR34","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/nav.5","volume":"48","author":"G. C. Zhang","year":"2001","unstructured":"Zhang, G. C., Cai, X. Q., & Wong, C. K. (2001). On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48, 241\u2013258.","journal-title":"Naval Research Logistics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0103-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0103-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0103-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T03:57:55Z","timestamp":1684900675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0103-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,24]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["103"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0103-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2009,2,24]]}}}