{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T23:40:02Z","timestamp":1748389202429,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190327"},{"type":"electronic","value":"9783319190334"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19033-4_5","type":"book-chapter","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T08:27:34Z","timestamp":1431419254000},"page":"55-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristics for Non-dominated Sets of Two-Agent Scheduling on a Single Parallel-Batching Machine"],"prefix":"10.1007","author":[{"given":"Jun-qiang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Cheng-wu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Guo-qiang","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Shu-dong","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,13]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4), 764\u2013775 (1992)","journal-title":"Oper. Res."},{"issue":"5","key":"5_CR2","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, A.I.: Heuristic algorithms for scheduling heat-treatment furnaces of steel casting industries. Sadhana 32(5), 479\u2013500 (2007)","journal-title":"Sadhana"},{"issue":"11","key":"5_CR3","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1080\/002075497194291","volume":"35","author":"DJ Van De Rzee","year":"1997","unstructured":"Van De Rzee, D.J., Van Harten, A., Schuur, P.C.: Dynamic job assignment heuristics for multi-server batch operations-a cost based approach. Int. J. Prod. Res. 35(11), 3063\u20133094 (1997)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"5_CR4","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(1), 7\u201316 (2003)","journal-title":"J. Sched."},{"issue":"2","key":"5_CR5","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., et al.: Scheduling problems with two competing agents. Oper. Res. 52(2), 229\u2013242 (2004)","journal-title":"Oper. Res."},{"key":"5_CR6","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, Heidelberg (2014)"},{"issue":"2","key":"5_CR7","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, M.T., Jolai, F.: Optimal methods for batch processing problem with makespan and maximum lateness objectives. Appl. Math. Model. 34(2), 314\u2013324 (2010)","journal-title":"Appl. Math. Model."},{"issue":"10","key":"5_CR8","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., et al.: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives. Appl. Math. Model. 37(10), 7071\u20137076 (2013)","journal-title":"Appl. Math. Model."},{"issue":"3","key":"5_CR9","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(3), 524\u2013531 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"5_CR10","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.: Unbounded parallel-batching scheduling with two competitive agents. J. Sched. 15(5), 629\u2013640 (2012)","journal-title":"J. Sched."},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10951-012-0274-0","volume":"16","author":"BQ Fan","year":"2013","unstructured":"Fan, B.Q., Cheng, T.C.E., Li, S.S., et al.: Bounded parallel-batching scheduling with two competing agents. J. Sched. 16(3), 261\u2013271 (2013)","journal-title":"J. Sched."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Tan, Q., Chen, H.P., Du, B., et al.: Two-agent scheduling on a single batch processing machine with non-identical job sizes. In: 2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), pp. 7431\u20137435. IEEE (2011)","DOI":"10.1109\/AIMSEC.2011.6009883"},{"key":"5_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman & Co, San Francisco (1979)"},{"key":"5_CR14","volume-title":"Multi-objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)"},{"key":"5_CR15","unstructured":"Johnson, D.S.: Near-optimal bin packing algorithms. Massachusetts Institute of Technology (1973)"},{"key":"5_CR16","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.H., Han, X., et al.: Tight absolute bound for First Fit Decreasing bin-packing: FFD(L)\u00a0\u2264\u00a011\/9 OPT(L)\u00a0+\u00a06\/9. Theoret. Comput. Sci. 510, 13\u201316 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28, 59\u201370 (1990)","journal-title":"Discrete Appl. Math."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyak","year":"1998","unstructured":"Czyak, P., Jaskiewicz, A.: Pareto simulated annealing-A metaheuristic technique for multiple objective combinatorial optimization. J. Multi-criteria Decis. Anal. 7, 34\u201347 (1998)","journal-title":"J. Multi-criteria Decis. Anal."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/TSMC.1971.4308298","volume":"1","author":"YY Haimes","year":"1971","unstructured":"Haimes, Y.Y., Lasdon, L.S., Wismer, D.A.: On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst. Man Cybern. 1, 296\u2013297 (1971)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., et al.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"5_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Communications in Computer and Information Science","Highlights of Practical Applications of Agents, Multi-Agent Systems, and Sustainability - The PAAMS Collection"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19033-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T23:12:06Z","timestamp":1748387526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19033-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190327","9783319190334"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19033-4_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}