乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T09:03:47Z","timestamp":1718960627195},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1016\/j.ejor.2014.03.026","type":"journal-article","created":{"date-parts":[[2014,3,29]],"date-time":"2014-03-29T01:40:49Z","timestamp":1396057249000},"page":"54-64","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["Fast approximation algorithms for bi-criteria scheduling with machine assignment costs"],"prefix":"10.1016","volume":"238","author":[{"given":"Kangbok","family":"Lee","sequence":"first","affiliation":[]},{"given":"Joseph Y-T.","family":"Leung","sequence":"additional","affiliation":[]},{"given":"Zhao-hong","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Wenhua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Michael L.","family":"Pinedo","sequence":"additional","affiliation":[]},{"given":"Bertrand M.T.","family":"Lin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejor.2014.03.026_b0005","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","article-title":"Scheduling problems with two competing agents","volume":"52","author":"Agnetis","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2014.03.026_b0010","series-title":"Multiprocessor scheduling: Theory and applications","first-page":"21","article-title":"Combinatorial models for multi-agent scheduling problems","author":"Agnetis","year":"2007"},{"issue":"1","key":"10.1016\/j.ejor.2014.03.026_b0015","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","article-title":"Bounds on list schedules for uniform processors","volume":"9","author":"Cho","year":"1980","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ejor.2014.03.026_b0020","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S009753970343395X","article-title":"Better online algorithms for scheduling with machine cost","volume":"33","author":"D\u00f2sa","year":"2004","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ejor.2014.03.026_b0025","series-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/j.ejor.2014.03.026_b0030","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing time anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"3","key":"10.1016\/j.ejor.2014.03.026_b0035","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","article-title":"Multicriteria scheduling","volume":"167","author":"Hoogeveen","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2014.03.026_b0040","doi-asserted-by":"crossref","unstructured":"Imreh, C., & Noga, J. (1999). Scheduling with machine cost. In Proceedings of 2nd international workshop on approximation algorithms. Lecture notes in computer science (Vol. 1671, pp. 168\u2013176).","DOI":"10.1007\/978-3-540-48413-4_18"},{"key":"10.1016\/j.ejor.2014.03.026_b0045","doi-asserted-by":"crossref","unstructured":"Khuller, S., Li, J., & Saha, B. (2010). Energy efficient scheduling via partial shutdown. In Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms (SODA \u201910) (pp. 1360\u20131372).","DOI":"10.1137\/1.9781611973075.110"},{"issue":"16","key":"10.1016\/j.ejor.2014.03.026_b0050","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.ipl.2009.04.018","article-title":"Approximation algorithms for multi-agent scheduling to minimize total weighted completion time","volume":"109","author":"Lee","year":"2009","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.ejor.2014.03.026_b0055","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.disopt.2011.05.001","article-title":"Coordination mechanisms with hybrid local policy","volume":"8","author":"Lee","year":"2011","journal-title":"Discrete Optimization"},{"issue":"2","key":"10.1016\/j.ejor.2014.03.026_b0060","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.ejor.2012.02.001","article-title":"Coordination mechanisms for parallel machine scheduling","volume":"220","author":"Lee","year":"2012","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2014.03.026_b0065","doi-asserted-by":"crossref","unstructured":"Lee, K., Leung, J. Y.-T., & Pinedo, M. L. (2013). Two dimensional load balancing. Working paper.","DOI":"10.1596\/1813-9450-6303"},{"issue":"9\u201310","key":"10.1016\/j.ejor.2014.03.026_b0070","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1007\/s00170-008-1770-4","article-title":"Multi-objective production scheduling: A survey","volume":"43","author":"Lei","year":"2009","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"10.1016\/j.ejor.2014.03.026_b0075","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.ijpe.2012.05.016","article-title":"Bi-criteria scheduling with machine assignment costs","volume":"139","author":"Leung","year":"2012","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2014.03.026_b0080","doi-asserted-by":"crossref","first-page":"1370","DOI":"10.1137\/S0097539702406388","article-title":"Minimizing total completion time on parallel machines with deadline constraints","volume":"32","author":"Leung","year":"2003","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ejor.2014.03.026_b0085","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","article-title":"Competitive two-agent scheduling and its applications","volume":"58","author":"Leung","year":"2010","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2014.03.026_b0090","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1137\/0218022","article-title":"Minimizing schedule length subject to minimum flow time","volume":"18","author":"Leung","year":"1989","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ejor.2014.03.026_b0095","series-title":"4th ed.","article-title":"Scheduling: Theory, algorithms, and systems","author":"Pinedo","year":"2012"},{"issue":"1\u20133","key":"10.1016\/j.ejor.2014.03.026_b0100","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","article-title":"An approximation algorithm for the generalized assignment problem","volume":"62","author":"Shmoys","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2014.03.026_b0105","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"10.1016\/j.ejor.2014.03.026_b0110","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1051\/ro:2001109","article-title":"Multicriteria scheduling problems: A survey","volume":"35","author":"T\u2019kindt","year":"2001","journal-title":"RAIRO \u2013 Operations Research"},{"key":"10.1016\/j.ejor.2014.03.026_b0115","series-title":"2nd ed.","article-title":"Multi-criteria scheduling \u2013 Theory, models and algorithms","author":"T\u2019kindt","year":"2006"},{"key":"10.1016\/j.ejor.2014.03.026_b0120","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(00)00288-5","article-title":"Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry","volume":"135","author":"T\u2019kindt","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2014.03.026_b0125","doi-asserted-by":"crossref","unstructured":"Vignier, A., Sonntag, B., & Portmann, M.-C. (1999). A hybrid method for a parallel-machine scheduling problem. In 7th IEEE international conference on emerging technologies and factory automation (ETFA \u201999) (pp. 671\u2013678).","DOI":"10.1109\/ETFA.1999.815418"},{"key":"10.1016\/j.ejor.2014.03.026_b0130","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02216826","article-title":"On the exact upper bound for the MultiFit processor scheduling algorithm","volume":"24","author":"Yue","year":"1990","journal-title":"Annals of Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221714002550?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221714002550?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T08:20:35Z","timestamp":1538727635000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221714002550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["S0377221714002550"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2014.03.026","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast approximation algorithms for bi-criteria scheduling with machine assignment costs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2014.03.026","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}