{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:45:28Z","timestamp":1765356328971,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T00:00:00Z","timestamp":1520380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. 51675442"],"award-info":[{"award-number":["No. 51675442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The 111 Project of NPU, China","award":["No. B13044"],"award-info":[{"award-number":["No. B13044"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s12652-018-0741-3","type":"journal-article","created":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T04:24:14Z","timestamp":1520396654000},"page":"999-1007","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Two-agent scheduling on a single parallel-batching machine to minimize the weighted sum of the agents\u2019 makespans"],"prefix":"10.1007","volume":"10","author":[{"given":"Cui-Lin","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5244-6483","authenticated-orcid":false,"given":"Jun-Qiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Cheng-Wu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,7]]},"reference":[{"issue":"2","key":"741_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 PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52(2):229\u2013242","journal-title":"Oper Res"},{"issue":"4","key":"741_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10951-008-0098-0","volume":"12","author":"A Agnetis","year":"2009","unstructured":"Agnetis A, de Pascale G, Pacciarelli D (2009) A lagrangian approach to single-machine scheduling problems with two competing agents. J Sched 12(4):401\u2013415","journal-title":"J Sched"},{"key":"741_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 JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling: models and algorithms. Springer, New York"},{"issue":"5","key":"741_CR4","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s12652-013-0190-y","volume":"5","author":"A Amato","year":"2014","unstructured":"Amato A, Martino BD, Venticinque S (2014) Agents based multi-criteria decision-aid. J Ambient Intell Hum Comput 5(5):747\u2013758","journal-title":"J Ambient Intell Hum Comput"},{"issue":"1","key":"741_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker KR, Smith JC (2003) A multiple-criterion model for machine scheduling. J Sched 6(1):7\u201316","journal-title":"J Sched"},{"key":"741_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-017-0510-8","author":"A Chaib","year":"2017","unstructured":"Chaib A, Boussebough I, Chaoui A (2017) Adaptive service composition in an ambient environment with a multi-agent system. J Ambient Intell Hum Comput. https:\/\/doi.org\/10.1007\/s12652-017-0510-8","journal-title":"J Ambient Intell Hum Comput"},{"issue":"1","key":"741_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.cor.2012.07.013","volume":"40","author":"TCE Cheng","year":"2013","unstructured":"Cheng TCE, Chung YH, Liao SC, Lee WC (2013) Two-agent singe-machine scheduling with release times to minimize the total weighted completion time. Comput Oper Res 40(1):353\u2013361","journal-title":"Comput Oper Res"},{"key":"741_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cie.2014.09.028","volume":"78","author":"TCE Cheng","year":"2014","unstructured":"Cheng TCE, Liu CY, Lee WC, Ji M (2014) Two-agent single-machine scheduling to minimize the weighted sum of the agents objective functions. Comput Ind Eng 78:66\u201373","journal-title":"Comput Ind Eng"},{"key":"741_CR9","unstructured":"Coffman\u00a0Jr EG, Garey MR, Johnson DS (1996) Approximation algorithms for bin packing: a survey. In: Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, pp 46\u201393"},{"key":"741_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-017-0575-4","author":"A Darwish","year":"2017","unstructured":"Darwish A, Hassanien AE (2017) Cyber physical systems design, methodology, and integration: the current status and future outlook. J Ambient Intell Hum Comput. https:\/\/doi.org\/10.1007\/s12652-017-0575-4","journal-title":"J Ambient Intell Hum Comput"},{"key":"741_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2013.09.007","volume":"510","author":"G D\u00f3sa","year":"2013","unstructured":"D\u00f3sa G, Li R, Han X, Tuza Z (2013) Tight absolute bound for first fit decreasing bin-packing: $${FFD(L)}\\le 11\/9~{OPT(L)}+6\/9$$ F F D ( L ) \u2264 11 \/ 9 O P T ( L ) + 6 \/ 9 . Theor Comput Sci 510:13\u201361","journal-title":"Theor Comput Sci"},{"issue":"3","key":"741_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10951-012-0274-0","volume":"16","author":"BQ Fan","year":"2012","unstructured":"Fan BQ, Cheng TCE, Li SS, Feng Q (2012) Bounded parallel-batching scheduling with two competing agents. J Sched 16(3):261\u2013271","journal-title":"J Sched"},{"issue":"10\u201311","key":"741_CR13","doi-asserted-by":"publisher","first-page":"7071","DOI":"10.1016\/j.apm.2013.03.013","volume":"37","author":"Q Feng","year":"2013","unstructured":"Feng Q, Yuan J, Liu H, He C (2013) A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives. Appl Math Modell 37(10\u201311):7071\u20137076","journal-title":"Appl Math Modell"},{"key":"741_CR14","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman & Co Ltd, New York"},{"key":"741_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.cor.2014.06.020","volume":"52","author":"S Gawiejnowicz","year":"2014","unstructured":"Gawiejnowicz S, Suwalski C (2014) Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria. Comput Oper Res 52:135\u2013146","journal-title":"Comput Oper Res"},{"key":"741_CR16","doi-asserted-by":"publisher","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":"741_CR17","unstructured":"Johnson DS (1973) Near optimal bin packing algorithms. Doctoral thesis, Massachusetts Institute of Technology, Dept. of Mathematics"},{"issue":"4","key":"741_CR18","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee CY, Uzsoy R, Martin-Vega LA (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Re 40(4):764\u2013775","journal-title":"Oper Re"},{"issue":"2","key":"741_CR19","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT Leung","year":"2010","unstructured":"Leung JYT, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper Res 58(2):458\u2013469","journal-title":"Oper Res"},{"issue":"5","key":"741_CR20","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s10951-011-0253-x","volume":"15","author":"S Li","year":"2012","unstructured":"Li S, Yuan J (2012) Unbounded parallel-batching scheduling with two competitive agents. J Sched 15(5):629\u2013640","journal-title":"J Sched"},{"issue":"9\u201310","key":"741_CR21","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","volume":"29","author":"M Mathirajan","year":"2006","unstructured":"Mathirajan M, Sivakumar AI (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Technol 29(9\u201310):990\u20131001","journal-title":"Int J Adv Manuf Technol"},{"issue":"5","key":"741_CR22","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s12046-007-0036-4","volume":"32","author":"M Mathirajan","year":"2007","unstructured":"Mathirajan M, Chandru V, Sivakumar AI (2007) Heuristic algorithms for scheduling heat-treatment furnaces of steel casting industries. Sadhana 32(5):479\u2013500","journal-title":"Sadhana"},{"issue":"3","key":"741_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 (2011) Single machine batch scheduling with two competing agents to minimize total flowtime. Eur J Oper Res 215(3):524\u2013531","journal-title":"Eur J Oper Res"},{"issue":"1","key":"741_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 QQ, Cheng TCE, Ng CT (2011) Two-agent scheduling to minimize the total cost. Eur J Oper Res 215(1):39\u201344","journal-title":"Eur J Oper Res"},{"issue":"1","key":"741_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.09.017","volume":"235","author":"P Perez-Gonzalez","year":"2014","unstructured":"Perez-Gonzalez P, Framinan JM (2014) A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems. Eur J Oper Res 235(1):1\u201316","journal-title":"Eur J Oper Res"},{"issue":"4","key":"741_CR26","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D Simchi-Levi","year":"1994","unstructured":"Simchi-Levi D (1994) New worst-case results for the bin-packing problem. Nav Res Logist 41(4):579\u2013585","journal-title":"Nav Res Logist"},{"issue":"2","key":"741_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s12652-009-0006-2","volume":"1","author":"DI Tapia","year":"2010","unstructured":"Tapia DI, Abraham A, Corchado JM, Alonso RS (2010) Agents and ambient intelligence: case studies. J Ambient Intell Hum Comput 1(2):85\u201393","journal-title":"J Ambient Intell Hum Comput"},{"issue":"11","key":"741_CR28","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1080\/002075497194291","volume":"35","author":"DJ Zee Van Der","year":"1997","unstructured":"Van Der Zee DJ, Van Harten A, Schuur PC (1997) Dynamic job assignment heuristics for multi-server batch operations\u2014a cost based approach. Int J Prod Res 35(11):3063\u20133094","journal-title":"Int J Prod Res"},{"issue":"3","key":"741_CR29","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00500-015-1817-z","volume":"21","author":"DJ Wang","year":"2017","unstructured":"Wang DJ, Yin Y, Wu WH, Wu WH, Wu CC, Hsu PH (2017a) A two-agent single-machine scheduling problem to minimize the total cost with release dates. Soft Comput 21(3):805\u2013816","journal-title":"Soft Comput"},{"issue":"2","key":"741_CR30","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.3934\/jimo.2016060","volume":"13","author":"JB Wang","year":"2017","unstructured":"Wang JB, Liu M, Yin N, Ji P (2017b) Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. J Ind Manag Optim 13(2):1025\u20131039","journal-title":"J Ind Manag Optim"},{"key":"741_CR31","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.cie.2016.05.039","volume":"98","author":"JQ Wang","year":"2016","unstructured":"Wang JQ, Chen J, Zhang Y, Huang GQ (2016) Schedule-based execution bottlenecks identification in a job shop. Comput Ind Eng 98:308\u2013322","journal-title":"Comput Ind Eng"},{"issue":"2","key":"741_CR32","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2016.10.024","volume":"258","author":"JQ Wang","year":"2017","unstructured":"Wang JQ, Fan GQ, Zhang Y, Zhang CW, Leung JYT (2017c) Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes. Eur J Oper Res 258(2):478\u2013490","journal-title":"Eur J Oper Res"},{"issue":"2","key":"741_CR33","doi-asserted-by":"publisher","first-page":"591","DOI":"10.3934\/jimo.2014.10.591","volume":"10","author":"WH Wu","year":"2014","unstructured":"Wu WH, Yin Y, Wu WH, Wu CC, Hsu PH (2014) A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents. J Ind Manag Optim 10(2):591\u2013611","journal-title":"J Ind Manag Optim"},{"issue":"2","key":"741_CR34","first-page":"131","volume":"33","author":"AR Yaghubian","year":"2001","unstructured":"Yaghubian AR, Hodgson TJ, Joines JA (2001) Dry-or-buy decision support for dry kiln scheduling in furniture production. IIE Trans 33(2):131\u2013136","journal-title":"IIE Trans"},{"issue":"2","key":"741_CR35","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.apm.2009.04.007","volume":"34","author":"MT Yazdani Sabouni","year":"2010","unstructured":"Yazdani Sabouni MT, Jolai F (2010) Optimal methods for batch processing problem with makespan and maximum lateness objectives. Appl Math Modell 34(2):314\u2013324","journal-title":"Appl Math Modell"},{"issue":"4","key":"741_CR36","doi-asserted-by":"crossref","first-page":"1674","DOI":"10.1016\/j.amc.2012.08.008","volume":"219","author":"Y Yin","year":"2012","unstructured":"Yin Y, Cheng SR, Cheng T, Wu CC, Wu WH (2012) Two-agent single-machine scheduling with assignable due dates. Appl Math Comput 219(4):1674\u20131685","journal-title":"Appl Math Comput"},{"key":"741_CR37","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tcs.2012.11.002","volume":"468","author":"K Zhao","year":"2013","unstructured":"Zhao K, Lu X (2013) Approximation schemes for two-agent scheduling on parallel machines. Theor ComputSci 468:114\u2013121","journal-title":"Theor ComputSci"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-018-0741-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0741-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0741-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T12:55:53Z","timestamp":1660568153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-018-0741-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,7]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["741"],"URL":"https:\/\/doi.org\/10.1007\/s12652-018-0741-3","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2018,3,7]]},"assertion":[{"value":"30 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}