{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:33:59Z","timestamp":1648917239996},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T00:00:00Z","timestamp":1132704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2005,12,8]]},"DOI":"10.1007\/s10852-005-9027-9","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T19:03:34Z","timestamp":1132686214000},"page":"435-453","source":"Crossref","is-referenced-by-count":4,"title":["Using a Hybrid Evolutionary Algorithm to Minimize Variance in Response Time for Multimedia Object Requests"],"prefix":"10.1007","volume":"4","author":[{"given":"Fawaz S.","family":"Al-Anzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Allahverdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,11,23]]},"reference":[{"key":"9027_CR1","first-page":"94","volume":"4","author":"F. Al-Anzi","year":"2001","unstructured":"Al-Anzi, F. and Allahverdi, A.: The relation between three-tired client-server internet database and two-machine flowshop, Int. J. Parallel Distrib. Syst. Netw. 4 (2001), 94\u2013101.","journal-title":"Int. J. Parallel Distrib. Syst. Netw."},{"key":"9027_CR2","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1016\/S0305-0548(00)00097-6","volume":"29","author":"A. Allahverdi","year":"2002","unstructured":"Allahverdi, A. and Al-Anzi, F.: Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications, Comput. Oper. Res. 29 (2002), 971\u2013994.","journal-title":"Comput. Oper. Res."},{"key":"9027_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A. Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J. N. D. and Aldowaisan, T.: A review of scheduling research involving setup considerations, OMEGA Int. J. Manag. Sci. 27 (1999), 219\u2013239.","journal-title":"OMEGA Int. J. Manag. Sci."},{"key":"9027_CR4","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1016\/S0305-0548(00)00036-8","volume":"28","author":"U. Al-Turki","year":"2001","unstructured":"Al-Turki, U., Fedjki, C. and Andijani, A.: Tabu search for a class of single-machine scheduling problems, Comput. Oper. Res. 28 (2001), 1223\u20131230.","journal-title":"Comput. Oper. Res."},{"key":"9027_CR5","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"H. G. Campbell","year":"1970","unstructured":"Campbell, H. G., Dudek, R. A. and Smith, M. L.: A heuristic algorithm for the n-job, m-machine sequencing problem, Manag. Sci. 16 (1970), B630\u2013B637.","journal-title":"Manag. Sci."},{"key":"9027_CR6","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/S0377-2217(00)00170-3","volume":"132","author":"G. Gowrishankar","year":"2001","unstructured":"Gowrishankar, G., Rajendran, C. and Srinivasan, G.: Flowshop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date, Eur. J. Oper. Res. 132 (2001), 643\u2013665.","journal-title":"Eur. J. Oper. Res."},{"key":"9027_CR7","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/opre.49.6.854.10014","volume":"49","author":"N. G. Hall","year":"2001","unstructured":"Hall, N. G. and Posner, M. E.: Generating experimental data for computational testing with machine scheduling applications, Oper. Res. 49 (2001), 854\u2013865.","journal-title":"Oper. Res."},{"key":"9027_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","volume":"14","author":"W. Kubiak","year":"1993","unstructured":"Kubiak, W.: Completion time variance minimization on a single machine is difficult, Oper. Res. Lett. 14 (1993), 49\u201359.","journal-title":"Oper. Res. Lett."},{"key":"9027_CR9","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1109\/49.536483","volume":"14","author":"Y. K. Kwok","year":"1996","unstructured":"Kwok, Y. K., Karlapalem, K., Ahmad, I. and Pun, N. M.: Design and Evaluation of Data Allocation Algorithms for Distributed Multimedia Database Systems, IEEE J. Sel. Areas in Commun. 14 (1996), 1332\u20131348.","journal-title":"IEEE J. Sel. Areas in Commun."},{"key":"9027_CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/S0377-2217(98)00002-2","volume":"114","author":"D. K. Manna","year":"1999","unstructured":"Manna, D. K. and Prasad V. R.: Bounds for the position of the smallest job in completion time variance minimization, Eur. J. Oper. Res. 114 (1999), 411\u2013419.","journal-title":"Eur. J. Oper. Res."},{"key":"9027_CR11","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1016\/S0305-0548(97)00032-4","volume":"24","author":"D. K. Manna","year":"1997","unstructured":"Manna, D. K. and Prasad V. R.: Pseudopolynomial algorithms for CTV minimization in single machine scheduling, Comput. Oper. Res. 24 (1997), 1119\u20131128.","journal-title":"Comput. Oper. Res."},{"key":"9027_CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0360-8352(98)00030-8","volume":"35","author":"C. A. Marangos","year":"1998","unstructured":"Marangos, C. A., Govande, V., Sirinvasan, G. and Zimmers Jr., W.: Algorithms to minimize completion time variance in a two-machine flowshop, Comput. Ind. Eng. 35 (1998), 101\u2013104.","journal-title":"Comput. Ind. Eng."},{"key":"9027_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E. and Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem, OMEGA Int. J. Manag. Sci. 11 (1983), 91\u201395.","journal-title":"OMEGA Int. J. Manag. Sci."},{"key":"9027_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0377-2217(95)00165-4","volume":"92","author":"C. T. Ng","year":"1996","unstructured":"Ng, C. T., Cai, X. and Cheng, T. C. E.: A tight lower bound for the completion time variance problem, Eur. J. Oper. Res. 92 (1996), 211\u2013213.","journal-title":"Eur. J. Oper. Res."},{"key":"9027_CR15","volume-title":"Principles of Distributed Database Systems","author":"M. T. Ozsu","year":"1991","unstructured":"Ozsu, M. T. and Valduriez, P.: Principles of Distributed Database Systems, Prentice-Hall, New Jersey, 1991."},{"key":"9027_CR16","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1057\/palgrave.jors.2600397","volume":"48","author":"C. H. Pan","year":"1997","unstructured":"Pan, C. H. and Chen, J. S.: Scheduling alternative operations in two-machine flow-shops, J. Oper. Res. Soc. 48 (1997), 533\u2013540.","journal-title":"J. Oper. Res. Soc."},{"key":"9027_CR17","volume-title":"Operations Scheduling with Applications in Manufacturing and Services","author":"M. Pinedo","year":"1999","unstructured":"Pinedo, M. and Chao, X.: Operations Scheduling with Applications in Manufacturing and Services, Irwing McGraw-Hill, Boston, 1999."},{"key":"9027_CR18","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1057\/palgrave.jors.2600408","volume":"48","author":"P. S. Sundararaghavan","year":"1997","unstructured":"Sundararaghavan, P. S., Kunnathur, A. S. and Viswanathan, I.: Minimizing makespan in parallel flowshops, J. Oper. Res. Soc. 48 (1997), 834\u2013842.","journal-title":"J. Oper. Res. Soc."},{"key":"9027_CR19","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1287\/opre.45.5.702","volume":"45","author":"M. Y. Wang","year":"1997","unstructured":"Wang, M. Y., Sethi, S. P. and Van De Velde, S. L.: Minimizing makespan in a class of reentrant shops, Oper. Res. 45 (1997), 702\u2013712.","journal-title":"Oper. Res."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9027-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-005-9027-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9027-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:26:29Z","timestamp":1559255189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-005-9027-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,23]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12,8]]}},"alternative-id":["9027"],"URL":"https:\/\/doi.org\/10.1007\/s10852-005-9027-9","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11,23]]}}}