{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T04:12:02Z","timestamp":1750997522481,"version":"3.41.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,10,17]],"date-time":"2017-10-17T00:00:00Z","timestamp":1508198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s12351-017-0355-0","type":"journal-article","created":{"date-parts":[[2017,10,17]],"date-time":"2017-10-17T10:33:45Z","timestamp":1508236425000},"page":"603-624","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling efficiency on correlated parallel machine scheduling problems"],"prefix":"10.1007","volume":"18","author":[{"given":"Yang-Kuei","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,17]]},"reference":[{"issue":"1","key":"355_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2010.03.030","volume":"207","author":"L Fanjul Peyro","year":"2010","unstructured":"Fanjul Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207(1):55\u201369","journal-title":"Eur J Oper Res"},{"issue":"2","key":"355_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0895-7177(94)90205-4","volume":"20","author":"CA Glass","year":"1994","unstructured":"Glass CA, Potts CN, Shade P (1994) Unrelated parallel machine scheduling using local search. Math Comput Model 20(2):41\u201352","journal-title":"Math Comput Model"},{"key":"355_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"key":"355_CR4","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/opre.49.6.854.10014","volume":"49","author":"NG Hall","year":"2001","unstructured":"Hall NG, Posner ME (2001) Generating experimental data for computational testing with machine scheduling applications. Oper Res 49:854\u2013865","journal-title":"Oper Res"},{"key":"355_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0305-0548(91)90034-O","volume":"18","author":"AMA Hariri","year":"1991","unstructured":"Hariri AMA, Potts CN (1991) Heuristics for scheduling unrelated parallel machines. Comput Oper Res 18:323\u2013331","journal-title":"Comput Oper Res"},{"key":"355_CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Bricker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 1:343\u2013362","journal-title":"Ann Discrete Math"},{"key":"355_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00170-013-4773-8","volume":"67","author":"YK Lin","year":"2013","unstructured":"Lin YK, Lin CW (2013) Dispatching rules for unrelated parallel machine scheduling with release dates. Int J Adv Manuf Technol 67:269\u2013279","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"355_CR8","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.cor.2010.08.018","volume":"38","author":"YK Lin","year":"2011","unstructured":"Lin YK, Pfund ME, Fowler JW (2011) Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Comput Oper Res 38(6):901\u2013916","journal-title":"Comput Oper Res"},{"issue":"6","key":"355_CR9","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s10951-013-0347-8","volume":"17","author":"YK Lin","year":"2014","unstructured":"Lin YK, Pfund ME, Fowler JW (2014) Processing time generation schemes for parallel machine scheduling problems with various correlation structures. J Sched 17(6):569\u2013586","journal-title":"J Sched"},{"key":"355_CR10","doi-asserted-by":"crossref","unstructured":"Lo V, Mache J, Windisch K (1998) A comparative study of real workload traces and synthetic workload models for parallel job scheduling. In: Workshop on job scheduling strategies for parallel processing, pp 25\u201346. Springer, Berlin","DOI":"10.1007\/BFb0053979"},{"key":"355_CR11","unstructured":"Lu D, Dinda P, Qiao Y, Sheng H (2005) Effects and implications of file size\/service time correlation on web server scheduling policies. In: 13th IEEE international symposium on modeling, analysis, and simulation of computer and telecommunication systems, pp 258\u2013267. IEEE"},{"key":"355_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.eswa.2016.06.014","volume":"62","author":"S Mirshekarian","year":"2016","unstructured":"Mirshekarian S, \u0160ormaz DN (2016) Correlation of job-shop scheduling problem features with scheduling efficiency. Expert Syst Appl 62:131\u2013147","journal-title":"Expert Syst Appl"},{"key":"355_CR13","doi-asserted-by":"crossref","first-page":"2731","DOI":"10.1016\/j.cor.2004.04.001","volume":"32","author":"L M\u00f6nch","year":"2005","unstructured":"M\u00f6nch L, Balasubramanian H, Fowler JW, Pfund ME (2005) Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput Oper Res 32:2731\u20132750","journal-title":"Comput Oper Res"},{"key":"355_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-642-80784-8_2","volume-title":"Proceedings of symposium on theory of scheduling and its applications","author":"SS Panwalkar","year":"1973","unstructured":"Panwalkar SS, Dudek RA, Smith ML (1973) Sequencing research and the industrial scheduling problem. In: Elmaghraby SE (ed) Proceedings of symposium on theory of scheduling and its applications. Springer, New York, pp 29\u201338"},{"key":"355_CR15","doi-asserted-by":"crossref","unstructured":"Pappu P, Wolf T (2002) Scheduling processing resources in programmable routers. In: INFOCOM 2002. Twenty-first annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE, vol 1, pp 104\u2013112. IEEE","DOI":"10.1109\/INFCOM.2002.1019251"},{"key":"355_CR16","volume-title":"Scheduling theory, algorithms, and systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo M (2016) Scheduling theory, algorithms, and systems, 5th edn. Prentice Hall, Upper Saddle River","edition":"5"},{"issue":"2","key":"355_CR17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(85)90009-5","volume":"10","author":"CN Potts","year":"1985","unstructured":"Potts CN (1985) Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Appl Math 10(2):155\u2013164","journal-title":"Discrete Appl Math"},{"key":"355_CR18","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"JP Sousa","year":"1992","unstructured":"Sousa JP, Wolsey LA (1992) A time indexed formulation of non-preemptive single machine scheduling problems. Math Program 54:353\u2013367","journal-title":"Math Program"},{"issue":"2","key":"355_CR19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.14.2.175.119","volume":"14","author":"T Vredeveld","year":"2002","unstructured":"Vredeveld T, Hurkens C (2002) Experimental comparison of approximation algorithms for scheduling unrelated parallel machines. INFORMS J Comput 14(2):175\u2013190","journal-title":"INFORMS J Comput"},{"key":"355_CR20","doi-asserted-by":"crossref","unstructured":"Yajima E, Hara T, Tsukamoto M, Nishio S (2001) Scheduling and caching strategies for broadcasting correlated data. In: Proceedings of the 2001 ACM symposium on applied computing, pp 504\u2013510. ACM","DOI":"10.1145\/372202.372444"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-017-0355-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0355-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0355-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T14:52:43Z","timestamp":1750949563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-017-0355-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,17]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["355"],"URL":"https:\/\/doi.org\/10.1007\/s12351-017-0355-0","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2017,10,17]]}}}