{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T07:36:13Z","timestamp":1762673773477},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T00:00:00Z","timestamp":1273190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10479-010-0752-8","type":"journal-article","created":{"date-parts":[[2010,5,6]],"date-time":"2010-05-06T12:33:32Z","timestamp":1273149212000},"page":"359-375","source":"Crossref","is-referenced-by-count":4,"title":["Infinite split scheduling: a new lower bound of\u00a0total\u00a0weighted completion time on parallel machines with job release dates and unavailability periods"],"prefix":"10.1007","volume":"181","author":[{"given":"Rabia","family":"Nessah","sequence":"first","affiliation":[]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,7]]},"reference":[{"key":"752_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0377-2217(97)00427-X","volume":"113","author":"M. Azizoglu","year":"1999","unstructured":"Azizoglu, M., & Kirca, O. (1999). On the minimization of total weighted flow time with identical and uniform parallel machines. European Journal of Operational Research, 113, 91\u2013100.","journal-title":"European Journal of Operational Research"},{"key":"752_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00238-3","volume":"13","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 13, 21\u201332.","journal-title":"Discrete Applied Mathematics"},{"key":"752_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(92)00176-M","volume":"48","author":"H. Belouadah","year":"1994","unstructured":"Belouadah, H., & Potts, C. N. (1994). Scheduling identical parallel machines to minimize total weighted completion time. Discrete Applied Mathematics, 48, 201\u2013218.","journal-title":"Discrete Applied Mathematics"},{"key":"752_CR4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0166-218X(92)90255-9","volume":"36","author":"H. Belouadah","year":"1992","unstructured":"Belouadah, H., Posner, M. E., & Potts, C. N. (1992). Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics, 36, 213\u2013231.","journal-title":"Discrete Applied Mathematics"},{"issue":"7","key":"752_CR5","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J. Bruno","year":"1974","unstructured":"Bruno, J., Coffman, E., & Sethi, R. (1974). Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17(7), 382\u2013387.","journal-title":"Communications of the ACM"},{"key":"752_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1018968332237","volume":"83","author":"J. Carlier","year":"1998","unstructured":"Carlier, J., & Pinson, E. (1998). Jackson\u2019s pseudo preemtive schedule for the Pm\/r i ,q i \/C max\u2009. Annals of Operations Research, 83, 41\u201358.","journal-title":"Annals of Operations Research"},{"key":"752_CR7","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z. L. Chen","year":"1999","unstructured":"Chen, Z. L., & Powell, W. B. (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 11, 78\u201394.","journal-title":"INFORMS Journal on Computing"},{"key":"752_CR8","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","volume":"11","author":"W. L. Eastman","year":"1964","unstructured":"Eastman, W. L., Even, S., & Isaacs, I. M. (1964). Bounds for the optimal scheduling of n jobs on m processors. Management Science, 11, 268\u2013279.","journal-title":"Management Science"},{"key":"752_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/05695557408974926","volume":"6","author":"S. E. Elmaghraby","year":"1974","unstructured":"Elmaghraby, S. E., & Park, S. H. (1974). Scheduling jobs on a number of identical machines. AIIE Transactions, 6, 1\u201313.","journal-title":"AIIE Transactions"},{"key":"752_CR10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimisation and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics, 4, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"752_CR11","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/opre.21.3.846","volume":"21","author":"W. Horn","year":"1973","unstructured":"Horn, W. (1973). Minimizing average flow time with parallel machines. Operations Research, 21, 846\u2013847.","journal-title":"Operations Research"},{"key":"752_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"E. L. Lawler","year":"1969","unstructured":"Lawler, E. L., & Moore, J. M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16, 77\u201384.","journal-title":"Management Science"},{"key":"752_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(92)90035-2","volume":"11","author":"C. Y. Lee","year":"1992","unstructured":"Lee, C. Y., & Uzsoy, R. (1992). A new dynamic programming algorithm for the parallel machines total weighted completion time problem. Operations Research Letters, 11, 73\u201375.","journal-title":"Operations Research Letters"},{"key":"752_CR14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J. K. Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"752_CR15","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1016\/j.cor.2006.07.010","volume":"35","author":"R. Nessah","year":"2008","unstructured":"Nessah, R., Yalaoui, F., & Chu, C. (2008). A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates. Computers & Operations Research, 35, 1176\u20131190.","journal-title":"Computers & Operations Research"},{"key":"752_CR16","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/00207548808947934","volume":"26","author":"S. C. Sarin","year":"1996","unstructured":"Sarin, S. C., Ahn, A., & Bishop, A. B. (1996). An improved branching scheme for the branch and bound procedure of scheduling n jobs to m parallel machines to minimize total weighted flow time. International Journal of Production Research, 26, 1183\u20131191.","journal-title":"International Journal of Production Research"},{"key":"752_CR17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. E. Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"752_CR18","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1287\/mnsc.38.1.124","volume":"38","author":"S. T. Webster","year":"1992","unstructured":"Webster, S. T. (1992). New bounds for the identical parallel processor weighted flow time problem. Management Science, 38, 124\u2013137.","journal-title":"Management Science"},{"key":"752_CR19","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0377-2217(93)90244-H","volume":"70","author":"S. T. Webster","year":"1993","unstructured":"Webster, S. T. (1993). A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems. European Journal of Operational Research, 70, 327\u2013334.","journal-title":"European Journal of Operational Research"},{"key":"752_CR20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0377-2217(93)E0142-K","volume":"80","author":"S. T. Webster","year":"1995","unstructured":"Webster, S. T. (1995). Weighted flow time bounds for scheduling identical processors. European Journal of Operational Research, 80, 103\u2013111.","journal-title":"European Journal of Operational Research"},{"key":"752_CR21","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.ijpe.2004.11.002","volume":"100","author":"F. Yalaoui","year":"2006","unstructured":"Yalaoui, F., & Chu, C. (2006). A new exact method to solve the Pm|r i |\u2211C i problem. International Journal of Production Economics, 100, 168\u2013179.","journal-title":"International Journal of Production Economics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0752-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0752-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0752-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:08:01Z","timestamp":1559138881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0752-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,7]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["752"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0752-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,7]]}}}