{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:07:05Z","timestamp":1760710025109,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["NRF-2018S1A5B8070344"],"award-info":[{"award-number":["NRF-2018S1A5B8070344"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11590-019-01494-x","type":"journal-article","created":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T20:33:06Z","timestamp":1571171586000},"page":"1869-1886","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A just-in-time scheduling problem with two competing agents"],"prefix":"10.1007","volume":"14","author":[{"given":"Byung-Cheon","family":"Choi","sequence":"first","affiliation":[]},{"given":"Jibok","family":"Chung","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3382-6514","authenticated-orcid":false,"given":"Myoung-Ju","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,15]]},"reference":[{"key":"1494_CR1","doi-asserted-by":"publisher","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.: Scheduling problems with two competing agents. Oper. Res. 52, 229\u2013242 (2004)","journal-title":"Oper. Res."},{"key":"1494_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","volume":"150","author":"A Agnetis","year":"2007","unstructured":"Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Multi-agent single machine scheduling. Ann. Oper. Res. 150, 3\u201315 (2007)","journal-title":"Ann. Oper. Res."},{"key":"1494_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent Scheduling-Models and Algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., Soukhal, A.: Multiagent Scheduling-Models and Algorithms. Springer, Berlin (2014)"},{"key":"1494_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RA Ahuja","year":"1990","unstructured":"Ahuja, R.A., Mehlhorn, K., Orlin, J.B.: Faster algorithm for the shortest path problem. J. Assoc. Comput. Mach. 37, 213\u2013223 (1990)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1494_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker, K.R., Smith, J.C.: A multiple-criterion model for machine scheduling. J. Sched. 6, 7\u201316 (2003)","journal-title":"J. Sched."},{"key":"1494_CR6","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1016\/j.cor.2004.05.011","volume":"32","author":"RL Cepek","year":"2005","unstructured":"Cepek, R.L., Sung, S.C.: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Comput. Oper. Res. 32, 3265\u20133271 (2005)","journal-title":"Comput. Oper. Res."},{"key":"1494_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"TCE Cheng","year":"2006","unstructured":"Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor. Comput. Sci. 362, 273\u2013281 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"1494_CR8","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"TCE Cheng","year":"2008","unstructured":"Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Multi-agent scheduling on a single machine with max-form criteria. Eur. J. Oper. Res. 188, 603\u2013609 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"1494_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2014.05.022","volume":"543","author":"BC Choi","year":"2014","unstructured":"Choi, B.C., Chung, J.: Two-agent single-machine scheduling problem with just-in-time jobs. Theor. Comput. Sci. 543, 37\u201345 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"1494_CR10","doi-asserted-by":"publisher","first-page":"1550044","DOI":"10.1142\/S021759591550044X","volume":"32","author":"B-C Choi","year":"2015","unstructured":"Choi, B.-C., Park, M.-J.: A batch scheduling problem with Two agents. Asia Pac. J. Oper. Res. 32, 1550044 (2015)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"1494_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10951-007-0030-z","volume":"10","author":"BC Choi","year":"2007","unstructured":"Choi, B.C., Yoon, S.H.: Maximizing the weighted number of just-in-time jobs in flow shop scheduling. J. Sched. 10, 237\u2013243 (2007)","journal-title":"J. Sched."},{"key":"1494_CR12","first-page":"19","volume":"37","author":"DY Chung","year":"2012","unstructured":"Chung, D.Y., Choi, B.C.: Just-in-time scheduling with competing agents. Korean Oper. Res. Manag. Sci. 37, 19\u201328 (2012)","journal-title":"Korean Oper. Res. Manag. Sci."},{"key":"1494_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/nav.21562","volume":"61","author":"E Gerstl","year":"2014","unstructured":"Gerstl, E., Mosheiov, G.: Single machine just-in-time scheduling problems with two competing agents. Nav. Res. Logist. 61, 1\u201316 (2014)","journal-title":"Nav. Res. Logist."},{"key":"1494_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E.L., Lenstra, J., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"1494_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17, 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"key":"1494_CR16","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/S0305-0548(00)00086-1","volume":"29","author":"K Hiraishi","year":"2002","unstructured":"Hiraishi, K., Levner, E., Vlach, M.: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Comput. Oper. Res. 29, 841\u2013848 (2002)","journal-title":"Comput. Oper. Res."},{"key":"1494_CR17","first-page":"27","volume":"10","author":"EL Lawler","year":"1976","unstructured":"Lawler, E.L.: Sequencing to minimize the weighted number of late jobs. RAIRO Rech. Oper. 10, 27\u201333 (1976)","journal-title":"RAIRO Rech. Oper."},{"key":"1494_CR18","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1016\/j.ipl.2009.04.018","volume":"109","author":"KB Lee","year":"2009","unstructured":"Lee, K.B., Choi, B.C., Leung, J.Y.T., Pinedo, M.L.: Approximation algorithms for multi-agent scheduling to minimize total weight completion time. Inf. Process. Lett. 109, 913\u2013917 (2009)","journal-title":"Inf. Process. Lett."},{"key":"1494_CR19","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A Lann","year":"1996","unstructured":"Lann, A., Mosheiov, G.: Single machine scheduling to minimize the number of early and tardy jobs. Comput. Oper. Res. 23, 769\u2013781 (1996)","journal-title":"Comput. Oper. Res."},{"key":"1494_CR20","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT Leung","year":"2010","unstructured":"Leung, J.Y.T., Pinedo, M.L., Wan, G.: Competitive two-agent scheduling and its applications. Oper. Res. 58, 458\u2013469 (2010)","journal-title":"Oper. Res."},{"key":"1494_CR21","doi-asserted-by":"publisher","first-page":"2290","DOI":"10.1016\/j.apm.2010.11.026","volume":"35","author":"P Liua","year":"2011","unstructured":"Liua, P., Yib, N., Zhoua, X.: Two-agent single-machine scheduling problems under increasing linear deterioration. Appl. Math. Model. 35, 2290\u20132296 (2011)","journal-title":"Appl. Math. Model."},{"key":"1494_CR22","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1016\/j.ejor.2010.03.003","volume":"206","author":"B Mor","year":"2010","unstructured":"Mor, B., Mosheiov, G.: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. Eur. J. Oper. Res. 206, 540\u2013546 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1494_CR23","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.ejor.2011.06.037","volume":"215","author":"B Mor","year":"2011","unstructured":"Mor, B., Mosheiov, G.: Single machine batch scheduling with two competing agents to minimize total flowtime. Eur. J. Oper. Res. 215, 524\u2013531 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"1494_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2011.05.041","volume":"215","author":"QQ Nong","year":"2011","unstructured":"Nong, Q.Q., Cheng, T.C.E., Ng, C.T.: Two-agent scheduling to minimize the total cost. Eur. J. Oper. Res. 215, 39\u201344 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"1494_CR25","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","volume":"8","author":"SC Sung","year":"2005","unstructured":"Sung, S.C., Vlach, M.: Maximizing weighted number of just-in-time jobs on unrelated parallel machines. J. Sched. 8, 453\u2013460 (2005)","journal-title":"J. Sched."},{"key":"1494_CR26","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1016\/j.cie.2011.08.007","volume":"61","author":"C-C Wu","year":"2011","unstructured":"Wu, C.-C., Huang, S.-K., Lee, W.-C.: Two-agent scheduling with learning consideration. Comput. Ind. Eng. 61, 1324\u20131335 (2011)","journal-title":"Comput. Ind. Eng."},{"key":"1494_CR27","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ins.2013.06.054","volume":"251","author":"C-C Wu","year":"2013","unstructured":"Wu, C.-C., Lee, W.-C., Liou, M.-J.: Single-machine scheduling with two competing agents and learning consideration. Inf. Sci. 251, 136\u2013149 (2013)","journal-title":"Inf. Sci."},{"key":"1494_CR28","doi-asserted-by":"publisher","first-page":"1650034","DOI":"10.1142\/S0217595916500342","volume":"33","author":"Z Wang","year":"2016","unstructured":"Wang, Z., Wei, C.-M., Wu, Y.-B.: Single machine two-agent scheduling with deteriorating jobs. Asia Pac. J. Oper. Res. 33, 1650034 (2016)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"1494_CR29","first-page":"1674","volume":"219","author":"Y Yin","year":"2012","unstructured":"Yin, Y., Cheng, S.-R., Cheng, T.-C.-E., Wu, W.-H., Wu, C.-C.: Two-agent single-machine scheduling with assignable due dates. Appl. Math. Comput. 219, 1674\u20131685 (2012)","journal-title":"Appl. Math. Comput."},{"key":"1494_CR30","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ins.2011.11.035","volume":"189","author":"Y Yin","year":"2012","unstructured":"Yin, Y., Cheng, S.-R., Wu, C.-C.: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Inf. Sci. 189, 282\u2013292 (2012)","journal-title":"Inf. Sci."},{"key":"1494_CR31","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2015.09.010","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Cheng, S.-R., Cheng, T.C.E., Wang, D.-J., Wu, C.-C.: Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega 63, 41\u201347 (2016)","journal-title":"Omega"},{"key":"1494_CR32","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cie.2015.01.002","volume":"81","author":"Y Yin","year":"2015","unstructured":"Yin, Y., Cheng, T.-C.-E., Long, W., Wu, C.-C., Jun, L.: Two-agent single-machine scheduling with deteriorating jobs. Comput. Ind. Eng. 81, 177\u2013185 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"1494_CR33","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10951-017-0511-7","volume":"20","author":"Y Yin","year":"2017","unstructured":"Yin, Y., Cheng, T.C.E., Wang, D.-J., Wu, C.-C.: Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. J. Sched. 20, 313\u2013335 (2017)","journal-title":"J. Sched."},{"key":"1494_CR34","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.cie.2014.10.025","volume":"79","author":"Y Yin","year":"2015","unstructured":"Yin, Y., Cheng, T.C.E., Yang, X., Wu, C.-C.: Two-agent single-machine scheduling with unrestricted due date assignment. Comput. Ind. Eng. 79, 148\u2013155 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"1494_CR35","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cie.2015.12.003","volume":"92","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Wang, Y., Cheng, T.C.E., Wang, D.-J., Wu, C.-C.: Two-agent single-machine scheduling to minimize the batch delivery cost. Comput. Ind. Eng. 92, 16\u201330 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"1494_CR36","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1002\/nav.21700","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Wang, D.-J., Wu, C.-C., Cheng, T.C.E.: CON\/SLK due date assignment and scheduling on a single machine with two agents. Nav. Res. Logist. 63, 416\u2013429 (2016)","journal-title":"Nav. Res. Logist."},{"key":"1494_CR37","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10951-005-4997-z","volume":"8","author":"JJ Yuan","year":"2005","unstructured":"Yuan, J.J., Shang, W.P., Feng, Q.: A note on the scheduling with two families of jobs. J. Sched. 8, 537\u2013542 (2005)","journal-title":"J. Sched."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01494-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-019-01494-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01494-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T23:29:04Z","timestamp":1602631744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-019-01494-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,15]]},"references-count":37,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1494"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01494-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2019,10,15]]},"assertion":[{"value":"3 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}