{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:58:29Z","timestamp":1772297909709,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T00:00:00Z","timestamp":1233187200000},"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-008-0098-0","type":"journal-article","created":{"date-parts":[[2009,1,28]],"date-time":"2009-01-28T16:12:03Z","timestamp":1233159123000},"page":"401-415","source":"Crossref","is-referenced-by-count":75,"title":["A Lagrangian approach to single-machine scheduling problems with two competing agents"],"prefix":"10.1007","volume":"12","author":[{"given":"Alessandro","family":"Agnetis","sequence":"first","affiliation":[]},{"given":"Gianluca","family":"de Pascale","sequence":"additional","affiliation":[]},{"given":"Dario","family":"Pacciarelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,29]]},"reference":[{"key":"98_CR1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ijpe.2004.12.023","volume":"104","author":"V. Albino","year":"2006","unstructured":"Albino, V., Carbonara, N., & Giannoccaro, I. (2006). Innovation in industrial districts: an agent-based simulation model. International Journal of Production Economics, 104, 30\u201345.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"98_CR2","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1002\/net.20023","volume":"44","author":"C. Arbib","year":"2004","unstructured":"Arbib, C., Servilio, M., & Smriglio, S. (2004). A competitive scheduling problem and its relevance to UMTS channel assignment. Networks, 44(2), 132\u2013141.","journal-title":"Networks"},{"issue":"2","key":"98_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1009637419820","volume":"6","author":"A. Agnetis","year":"2000","unstructured":"Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2000). Nondominated schedules for a job-shop with two competing agents. Computational and Mathematical Organization Theory, 6(2), 191\u2013217.","journal-title":"Computational and Mathematical Organization Theory"},{"issue":"2","key":"98_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A. Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52(2), 229\u2013242.","journal-title":"Operations Research"},{"issue":"1","key":"98_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K. R. Baker","year":"2003","unstructured":"Baker, K. R., & Cole Smith, J. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6(1), 7\u201316.","journal-title":"Journal of Scheduling"},{"key":"98_CR6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"T. C. E. Cheng","year":"2006","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273\u2013281.","journal-title":"Theoretical Computer Science"},{"key":"98_CR7","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"T. C. E. Cheng","year":"2008","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2008). Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research, 188, 603\u2013609.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"98_CR8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"C. T. Ng","year":"2006","unstructured":"Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2006). A note on the complexity of the problem of two-agent scheduling on a single machine. Journal of Combinatorial Optimization, 12(4), 387\u2013394.","journal-title":"Journal of Combinatorial Optimization"},{"key":"98_CR9","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/S0167-6377(03)00048-8","volume":"31","author":"Y. Pan","year":"2003","unstructured":"Pan, Y. (2003). An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Operations Research Letters, 31, 492\u2013496.","journal-title":"Operations Research Letters"},{"issue":"10","key":"98_CR10","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1016\/0305-0548(94)00090-U","volume":"22","author":"J. M. Peha","year":"1995","unstructured":"Peha, J. M. (1995). Heterogeneous-criteria scheduling: minimizing weighted number of tardy jobs and weighted completion time. Journal of Computers and Operations Research, 22(10), 1089\u20131100.","journal-title":"Journal of Computers and Operations Research"},{"issue":"3","key":"98_CR11","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/opre.33.3.562","volume":"33","author":"M. E. Posner","year":"1985","unstructured":"Posner, M. E. (1985). Minimizing weighted completion times with deadlines. Operations Research, 33(3), 562\u2013574.","journal-title":"Operations Research"},{"issue":"1","key":"98_CR12","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(1), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"98_CR13","unstructured":"Sourd, F. (2008). Private communication."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0098-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0098-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0098-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:42Z","timestamp":1559468382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0098-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,29]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["98"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0098-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,29]]}}}