{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T05:15:45Z","timestamp":1776921345509,"version":"3.51.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,11,6]],"date-time":"2010-11-06T00:00:00Z","timestamp":1289001600000},"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":[[2011,10]]},"DOI":"10.1007\/s10951-010-0201-1","type":"journal-article","created":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T14:52:16Z","timestamp":1288968736000},"page":"471-481","source":"Crossref","is-referenced-by-count":43,"title":["Scheduling two agents on uniform parallel machines with\u00a0makespan and cost functions"],"prefix":"10.1007","volume":"14","author":[{"given":"Donatas","family":"Elvikis","sequence":"first","affiliation":[]},{"given":"Horst W.","family":"Hamacher","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"T\u2019kindt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,6]]},"reference":[{"issue":"2","key":"201_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1009637419820","volume":"6","author":"A. Agnetis","year":"2000","unstructured":"Agnetis, A., Mirchandani, P., Pacciarelli, D., & Pacifici, A. (2000). Nondominated schedules for a job-shop with two competing users. Computational & Mathematical Organization Theory, 6(2), 191\u2013217.","journal-title":"Computational & Mathematical Organization Theory"},{"issue":"2","key":"201_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"42","author":"A. Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 42(2), 229\u2013242.","journal-title":"Operations Research"},{"key":"201_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K. Baker","year":"2003","unstructured":"Baker, K., & Smith, J. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"201_CR4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2008.10.038","volume":"199","author":"H. Balasubramanian","year":"2009","unstructured":"Balasubramanian, H., Fowler, J., Keha, A., & Pfund, M. (2009). Scheduling interfering job sets on parallel machines. European Journal of Operational Research, 199(1), 55\u201367. doi: 10.1016\/j.ejor.2008.10.038 .","journal-title":"European Journal of Operational Research"},{"key":"201_CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","volume":"2","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2, 245\u2013252.","journal-title":"Journal of Scheduling"},{"issue":"1\u20133","key":"201_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00238-3","volume":"103","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103(1\u20133), 21\u201332. doi: 10.1016\/S0166-218X(99)00238-3 .","journal-title":"Discrete Applied Mathematics"},{"issue":"13","key":"201_CR7","doi-asserted-by":"crossref","first-page":"2071","DOI":"10.1016\/S0305-0548(02)00116-8","volume":"30","author":"P. Baptiste","year":"2003","unstructured":"Baptiste, P. (2003). A note on scheduling multiprocessor tasks with identical processing times. Computers and Operations Research, 30(13), 2071\u20132078.","journal-title":"Computers and Operations Research"},{"key":"201_CR8","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"P. Baptiste","year":"2004","unstructured":"Baptiste, P., & Brucker, P. (2004). Scheduling equal processing time jobs. In J. Y. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis. London\/ Boca Raton: Chapman & Hall \/ CRC Press."},{"key":"201_CR9","unstructured":"Baptiste, P., Chrobak, M., D\u00fcrr, C., & Sourd, F. (2004). Preemptive multi-machine scheduling of equal-length jobs to minimize the average flow time. arXiv:cs\/0412094 ."},{"key":"201_CR10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10951-008-0063-y","volume":"11","author":"P. Brucker","year":"2008","unstructured":"Brucker, P., & Kravchenko, S. (2008). Scheduling jobs with equal processing times and time windows on identical parallel machines. Journal of Scheduling, 11, 229\u2013237.","journal-title":"Journal of Scheduling"},{"key":"201_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"T. Cheng","year":"2006","unstructured":"Cheng, T., Ng, C., & Yuan, 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":"201_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10951-006-5595-4","volume":"9","author":"M. Chrobak","year":"2006","unstructured":"Chrobak, M., Durr, C., Jawor, W., Kowalik, L., & Kurowski, M. (2006). A note on scheduling equal-length jobs to maximize throughput. Journal of Scheduling, 9, 71\u201373.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"201_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1467-9574.1990.tb01276.x","volume":"44","author":"M. I. Dessouky","year":"1990","unstructured":"Dessouky, M. I., Lageweg, B. J., Lenstra, J. K., & van\u00a0de Velde, S. L. (1990). Scheduling identical jobs on uniform parallel machines. Statistica Neerlandica, 44(3), 115\u2013123.","journal-title":"Statistica Neerlandica"},{"key":"201_CR14","volume-title":"Multicriteria optimization","author":"M. Ehrgott","year":"2005","unstructured":"Ehrgott, M. (2005). Multicriteria optimization (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"201_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., EL, Lawler, Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"201_CR16","volume-title":"IEEE\u2014RIVF international conference on computing and communication technologies (RIVF\u201909)","author":"N. Huynh Tuong","year":"2009","unstructured":"Huynh Tuong, N., & Soukhal, A. (2009). Interfering job set scheduling on two-operation three-machine flowshop. In IEEE\u2014RIVF international conference on computing and communication technologies (RIVF\u201909), Da Nang, Vietnam."},{"key":"201_CR17","unstructured":"Huynh Tuong, N., Soukhal, A., & Billaut, J. C. (2009). New scheduling problems with interfering and independent jobs, 33\u00a0p. Paper submitted to Journal of Scheduling the 8 September 2009."},{"issue":"5","key":"201_CR18","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"E. L. Lawler","year":"1973","unstructured":"Lawler, E. L. (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19(5), 544\u2013546. doi: 10.1287\/mnsc.19.5.544 .","journal-title":"Management Science"},{"issue":"2","key":"201_CR19","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"J. Y. T. Leung","year":"2010","unstructured":"Leung, J. Y. T., Pinedo, M., & Wan, G. (2010). Competitive Two-Agent Scheduling and Its Applications. Operations Research, 58(2), 458\u2013469. doi: 10.1287\/opre.1090.0744 .","journal-title":"Operations Research"},{"issue":"4","key":"201_CR20","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"C. Ng","year":"2006","unstructured":"Ng, C., Cheng, T., & Yuan, 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. doi: 10.1007\/s10878-006-9001-0 .","journal-title":"Journal of Combinatorial Optimization"},{"key":"201_CR21","volume-title":"Multicriteria scheduling: theory, models and algorithms","author":"V. T\u2019kindt","year":"2006","unstructured":"T\u2019kindt, V., & Billaut, J. C. (2006). Multicriteria scheduling: theory, models and algorithms (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"1","key":"201_CR22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0305-0548(97)00038-5","volume":"25","author":"A. Tuzikov","year":"1998","unstructured":"Tuzikov, A., Makhaniok, M., & M\u00e4nner, R. (1998). Bicriterion scheduling of identical processing time jobs by uniform processors. Computers and Operations Research, 25(1), 31\u201335.","journal-title":"Computers and Operations Research"},{"key":"201_CR23","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10951-005-4997-z","volume":"8","author":"J. Yuan","year":"2005","unstructured":"Yuan, J., Shang, W., & Feng, Q. (2005). A note on the scheduling with two families of jobs. Journal of Scheduling, 8, 537\u2013542.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0201-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0201-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0201-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:45Z","timestamp":1559453985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0201-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,6]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0201-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,6]]}}}