{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:17:13Z","timestamp":1761621433572},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,2,8]],"date-time":"2019-02-08T00:00:00Z","timestamp":1549584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,8]],"date-time":"2019-02-08T00:00:00Z","timestamp":1549584000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10479-019-03160-y","type":"journal-article","created":{"date-parts":[[2019,2,8]],"date-time":"2019-02-08T16:55:07Z","timestamp":1549644907000},"page":"191-223","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent"],"prefix":"10.1007","volume":"294","author":[{"given":"Jun","family":"Pei","sequence":"first","affiliation":[]},{"given":"Jinling","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Baoyu","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,8]]},"reference":[{"key":"3160_CR1","doi-asserted-by":"crossref","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. (2014). Multiagent scheduling: Models and algorithms. Berlin: Springer."},{"issue":"2","key":"3160_CR2","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":"2","key":"3160_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.ijpe.2011.12.003","volume":"136","author":"C Arbib","year":"2012","unstructured":"Arbib, C., Marinelli, F., & Pezzella, F. (2012). An LP-based tabu search for batch scheduling in a cutting process with finite buffers. International Journal of Production Economics, 136(2), 287\u2013296.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"3160_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1057\/palgrave.jors.2601689","volume":"55","author":"A Bachman","year":"2004","unstructured":"Bachman, A., & Janiak, A. (2004). Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society, 55(3), 257\u2013264.","journal-title":"Journal of the Operational Research Society"},{"key":"3160_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker, K. R., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"3160_CR6","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1016\/j.ejor.2006.06.079","volume":"189","author":"MS Barketau","year":"2008","unstructured":"Barketau, M. S., Cheng, T. C. E., & Kovalyov, M. Y. (2008). Batch scheduling of deteriorating reworkables. European Journal of Operational Research, 189(3), 1317\u20131326.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3160_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.cor.2012.07.013","volume":"40","author":"TCE Cheng","year":"2013","unstructured":"Cheng, T. C. E., Chung, Y. H., Liao, S. C., & Lee, W. C. (2013). Two-agent singe-machine scheduling with release times to minimize the total weighted completion time. Computers & Operations Research, 40(1), 353\u2013361.","journal-title":"Computers & Operations Research"},{"key":"3160_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TCE Cheng","year":"2004","unstructured":"Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time dependent processing times. European Journal of Operational Research, 152, 1\u201313.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3160_CR9","doi-asserted-by":"crossref","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. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362(1), 273\u2013281.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"3160_CR10","doi-asserted-by":"crossref","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. (2008). Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research, 188(2), 603\u2013609.","journal-title":"European Journal of Operational Research"},{"issue":"21","key":"3160_CR11","doi-asserted-by":"crossref","first-page":"8804","DOI":"10.1016\/j.amc.2011.04.005","volume":"217","author":"TCE Cheng","year":"2011","unstructured":"Cheng, T. C. E., Wu, W. H., Cheng, S. R., & Wu, C. C. (2011). Two-agent scheduling with position-based deteriorating jobs and learning effects. Applied Mathematics and Computation, 217(21), 8804\u20138824.","journal-title":"Applied Mathematics and Computation"},{"issue":"06","key":"3160_CR12","doi-asserted-by":"crossref","first-page":"1550044","DOI":"10.1142\/S021759591550044X","volume":"32","author":"BC Choi","year":"2015","unstructured":"Choi, B. C., & Park, M. J. (2015). A batch scheduling problem with two agents. Asia-Pacific Journal of Operational Research, 32(06), 1550044.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"6","key":"3160_CR13","doi-asserted-by":"crossref","first-page":"2772","DOI":"10.1016\/j.eswa.2013.10.010","volume":"41","author":"S Devi","year":"2014","unstructured":"Devi, S., & Geethanjali, M. (2014). Application of modified bacterial foraging optimization algorithm for optimal placement and sizing of distributed generation. Expert Systems with Applications, 41(6), 2772\u20132781.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"3160_CR14","first-page":"29","volume":"27","author":"S Diakit\u00e9","year":"2012","unstructured":"Diakit\u00e9, S., Nicod, J. M., Philippe, L., & Toch, L. (2012). Assessing new approaches to schedule a batch of identical intree-shaped workflows on a heterogeneous platform. Parallel Algorithms and Applications, 27(1), 29.","journal-title":"Parallel Algorithms and Applications"},{"issue":"3","key":"3160_CR15","doi-asserted-by":"crossref","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., & Feng, Q. (2013). Bounded parallel-batching scheduling with two competing agents. Journal of Scheduling, 16(3), 261\u2013271.","journal-title":"Journal of Scheduling"},{"issue":"10\u201311","key":"3160_CR16","doi-asserted-by":"crossref","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. Applied Mathematical Modelling, 37(10\u201311), 7071\u20137076.","journal-title":"Applied Mathematical Modelling"},{"key":"3160_CR17","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer."},{"issue":"11","key":"3160_CR18","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1057\/jors.2010.171","volume":"62","author":"S Gawiejnowicz","year":"2011","unstructured":"Gawiejnowicz, S., Lee, W. C., Lin, C. L., & Wu, C. C. (2011). Single-machine scheduling of proportionally deteriorating jobs by two agents. The Journal of the Operational Research Society, 62(11), 1983\u20131991.","journal-title":"The Journal of the Operational Research Society"},{"issue":"1","key":"3160_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5(1), 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"5","key":"3160_CR20","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10951-017-0546-9","volume":"21","author":"M Gu","year":"2018","unstructured":"Gu, M., Gu, J. W., & Lu, X. W. (2018). An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines. Journal of Schedule, 21(5), 483\u2013492.","journal-title":"Journal of Schedule"},{"issue":"4","key":"3160_CR21","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","volume":"14","author":"JND Gupta","year":"1988","unstructured":"Gupta, J. N. D., & Gupta, S. K. (1988). Single facility scheduling with nonlinear processing times. Computers & Industrial Engineering, 14(4), 387\u2013393.","journal-title":"Computers & Industrial Engineering"},{"key":"3160_CR22","first-page":"621","volume-title":"Handbook of metaheuristics","author":"P Hansen","year":"2003","unstructured":"Hansen, P., Mladenovic, N., Brimberg, J., & Perez, J. A. M. (2003). Variable neighborhood search. In Kochenberger Glover (Ed.), Handbook of metaheuristics (pp. 621\u2013757). London: Kluwer Academic Publishers."},{"issue":"5\u20138","key":"3160_CR23","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1007\/s00170-016-9156-5","volume":"89","author":"L Jiang","year":"2017","unstructured":"Jiang, L., Pei, J., Liu, X., Pardalos, P. M., Yang, Y., & Qian, X. (2017). Uniform parallel batch machines scheduling considering transportation using a hybrid DPSO-GA algorithm. The International Journal of Advanced Manufacturing Technology, 89(5\u20138), 1887\u20131990.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"18","key":"3160_CR24","doi-asserted-by":"crossref","first-page":"3918","DOI":"10.1016\/j.ins.2007.04.002","volume":"177","author":"D Kim","year":"2007","unstructured":"Kim, D., Abraham, A., & Cho, J. H. (2007). A hybrid genetic algorithm and bacterial foraging approach for global optimization. Information Sciences, 177(18), 3918\u20133937.","journal-title":"Information Sciences"},{"issue":"4","key":"3160_CR25","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10951-014-0410-0","volume":"18","author":"MY Kovalyov","year":"2015","unstructured":"Kovalyov, M. Y., Oulamara, A., & Soukhal, A. (2015). Two-agent scheduling with agent specific batches on an unbounded serial batching machine. Journal of Scheduling, 18(4), 423\u2013434.","journal-title":"Journal of Scheduling"},{"issue":"6","key":"3160_CR26","first-page":"962","volume":"49","author":"WC Lee","year":"2016","unstructured":"Lee, W. C., Chung, Y. H., & Wang, J. Y. (2016). A parallel-machine scheduling problem with two competing agents. Engineering Optimization, 49(6), 962\u2013975.","journal-title":"Engineering Optimization"},{"issue":"10","key":"3160_CR27","doi-asserted-by":"crossref","first-page":"3098","DOI":"10.1016\/j.apm.2010.01.015","volume":"34","author":"WC Lee","year":"2010","unstructured":"Lee, W. C., Wang, W. J., Shiau, Y. R., & Wu, C. C. (2010). A single-machine scheduling problem with two-agent and deteriorating jobs. Applied Mathematical Modelling, 34(10), 3098\u20133107.","journal-title":"Applied Mathematical Modelling"},{"key":"3160_CR28","first-page":"125","volume":"80","author":"D Lei","year":"2015","unstructured":"Lei, D. (2015). Variable neighborhood search for two-agent flow shop scheduling problem. Computers & Operations Research, 80, 125\u2013131.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3160_CR29","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT 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.","journal-title":"Operations Research"},{"issue":"8","key":"3160_CR30","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1002\/nav.21779","volume":"64","author":"S Li","year":"2017","unstructured":"Li, S., Cheng, T. C. E., Ng, C. T., & Yuan, J. (2017). Two-agent scheduling on a single sequential and compatible batching machine. Naval Research Logistics, 64(8), 628\u2013641.","journal-title":"Naval Research Logistics"},{"issue":"5","key":"3160_CR31","doi-asserted-by":"crossref","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. Journal of Scheduling, 15(5), 629\u2013640.","journal-title":"Journal of Scheduling"},{"issue":"5\u20138","key":"3160_CR32","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s00170-009-2224-3","volume":"47","author":"P Liu","year":"2010","unstructured":"Liu, P., Tang, L., & Zhou, X. (2010a). Two-agent group scheduling with deteriorating jobs on a single machine. International Journal of Advanced Manufacturing Technology, 47(5\u20138), 657\u2013664.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"5","key":"3160_CR33","doi-asserted-by":"crossref","first-page":"2290","DOI":"10.1016\/j.apm.2010.11.026","volume":"35","author":"P Liu","year":"2011","unstructured":"Liu, P., Yi, N., & Zhou, X. (2011). Two-agent single-machine scheduling problems under increasing linear deterioration. Applied Mathematical Modelling, 35(5), 2290\u20132296.","journal-title":"Applied Mathematical Modelling"},{"issue":"17","key":"3160_CR34","doi-asserted-by":"crossref","first-page":"8848","DOI":"10.1016\/j.amc.2013.03.040","volume":"219","author":"P Liu","year":"2013","unstructured":"Liu, P., Yi, N., Zhou, X., & Gong, H. (2013). Scheduling two agents with sum-of-processing-times-based deterioration on a single machine. Applied Mathematics and Computation, 219(17), 8848\u20138855.","journal-title":"Applied Mathematics and Computation"},{"issue":"1\u20134","key":"3160_CR35","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s00170-009-2259-5","volume":"48","author":"P Liu","year":"2010","unstructured":"Liu, P., Zhou, X., & Tang, L. (2010b). Two-agent single-machine scheduling with position-dependent processing times. International Journal of Advanced Manufacturing Technology, 48(1\u20134), 325\u2013331.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"3160_CR36","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1418986","author":"X Liu","year":"2017","unstructured":"Liu, X., Lu, S., Pei, J., & Pardalos, P. M. (2017). A hybrid VNS-HS algorithm for a supply chain scheduling problem with deteriorating jobs. International Journal of Production Research. https:\/\/doi.org\/10.1080\/00207543.2017.1418986.","journal-title":"International Journal of Production Research"},{"key":"3160_CR37","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.asoc.2018.02.018","volume":"66","author":"S Lu","year":"2018","unstructured":"Lu, S., Liu, X., Pei, J., Thai, M. T., & Pardalos, P. M. (2018). A hybrid ABC-TS algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity. Applied Soft Computing, 66, 168\u2013182.","journal-title":"Applied Soft Computing"},{"issue":"3","key":"3160_CR38","doi-asserted-by":"crossref","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. European Journal of Operational Research, 215(3), 524\u2013531.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3160_CR39","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov, G. (2001). Scheduling problems with a learning effect. European Journal of Operational Research, 132(3), 687\u2013693.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3160_CR40","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1016\/j.ejor.2006.01.052","volume":"18","author":"G Mosheiov","year":"2008","unstructured":"Mosheiov, G., & Oron, D. (2008). A single machine batch scheduling problem with bounded batch size. European Journal of Operational Research, 18(3), 1069\u20131079.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"3160_CR41","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1080\/00207543.2016.1253889","volume":"55","author":"O Ozturk","year":"2017","unstructured":"Ozturk, O., Begen, M. A., & Zaric, G. S. (2017). A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan. International Journal of Production Research, 55(6), 1815\u20131831.","journal-title":"International Journal of Production Research"},{"issue":"9","key":"3160_CR42","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"Q-K Pan","year":"2011","unstructured":"Pan, Q.-K., Tasgetiren, M. F., & Liang, Y. C. (2011). A discrete particle optimization algorithm for the no-wait flowshop scheduling problem. Computer & Operations Research, 35(9), 2807\u20132839.","journal-title":"Computer & Operations Research"},{"issue":"3","key":"3160_CR43","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/15567249.2010.485167","volume":"9","author":"VR Pandi","year":"2014","unstructured":"Pandi, V. R., Panigrahi, B. K., Hong, W. C., & Sharma, R. (2014). A multiobjective bacterial foraging algorithm to solve the environmental economic dispatch problem. Energy Sources, Part B: Economics, Planning and Policy, 9(3), 236\u2013247.","journal-title":"Energy Sources, Part B: Economics, Planning and Policy"},{"issue":"11","key":"3160_CR44","doi-asserted-by":"crossref","first-page":"3500","DOI":"10.1016\/j.asoc.2012.06.011","volume":"12","author":"N Pandit","year":"2012","unstructured":"Pandit, N., Tripathi, A., Tapaswi, S., & Pandit, M. (2012). An improved bacterial foraging algorithm for combined static\/dynamic enviromental economic dispatch. Applied Soft Computing, 12(11), 3500\u20133513.","journal-title":"Applied Soft Computing"},{"key":"3160_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1317-9","author":"B Pang","year":"2018","unstructured":"Pang, B., Song, Y., Zhang, C. J., Wang, H. L., & Yang, R. T. (2018). Bacterial foraging optimization based on improved chemotaxis process and novel swarming strategy. Applied Intelligence. https:\/\/doi.org\/10.1007\/s10489-018-1317-9.","journal-title":"Applied Intelligence"},{"issue":"3","key":"3160_CR47","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/MCS.2002.1004010","volume":"22","author":"KM Passino","year":"2002","unstructured":"Passino, K. M. (2002). Biomimicry of bacterial foraging for distributed optimization. IEEE Control Systems, 22(3), 52\u201367.","journal-title":"IEEE Control Systems"},{"key":"3160_CR48","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0876","author":"J Pei","year":"2018","unstructured":"Pei, J., Darzic, Z., Drazic, M., Mladenovic, N., & Pardalos, P. M. (2018b). Continuous variable neighborhood search (C-VNS) for solving systems of nonlinear equations. INFORMS Journal on Computing. https:\/\/doi.org\/10.1287\/ijoc.2018.0876.","journal-title":"INFORMS Journal on Computing"},{"key":"3160_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2017.12.003","author":"J Pei","year":"2017","unstructured":"Pei, J., Liu, X., Fan, W., Pardalos, P. M., & Lu, S. (2017a). A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs financial budget and resource constraint in multiple manufacturers. Omega. https:\/\/doi.org\/10.1016\/j.omega.2017.12.003.","journal-title":"Omega"},{"issue":"1\u20132","key":"3160_CR50","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10479-015-1824-6","volume":"249","author":"J Pei","year":"2017","unstructured":"Pei, J., Liu, X., Pardalos, P. M., Fan, W., & Yang, S. (2017b). Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Annals of Operations Research, 249(1\u20132), 175\u2013195.","journal-title":"Annals of Operations Research"},{"issue":"1\u20134","key":"3160_CR51","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00170-013-5263-8","volume":"70","author":"J Pei","year":"2014","unstructured":"Pei, J., Liu, X., Pardalos, P. M., Fan, W., Yang, S., & Wang, L. (2014). Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain. International Journal of Advanced Manufacturing Technology, 70(1\u20134), 335\u2013348.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"3160_CR52","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ejor.2014.11.034","volume":"244","author":"J Pei","year":"2015","unstructured":"Pei, J., Pardalos, P. M., Liu, X., Fan, W., & Yang, S. (2015). Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. European Journal of Operational Research, 244(1), 13\u201325.","journal-title":"European Journal of Operational Research"},{"key":"3160_CR53","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2018.1464428","author":"J Pei","year":"2018","unstructured":"Pei, J., Wang, X., Fan, W., & Pardalos, P. M. (2018a). Scheduling step-deteriorating jobs on bounded parallel-batching machines to maximise the total net revenue. Journal of the Operational Research Society. https:\/\/doi.org\/10.1080\/01605682.2018.1464428.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"3160_CR55","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2017.05.019","volume":"263","author":"L Tang","year":"2017","unstructured":"Tang, L., Zhao, X., Liu, J., & Leung, J. Y. T. (2017). Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine. European Journal of Operational Research, 263(2), 401\u2013411.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3160_CR56","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ejor.2010.01.005","volume":"205","author":"G Wan","year":"2010","unstructured":"Wan, G., Vakati, S. R., Leung, Y. T., & Pinedo, M. (2010). Scheduling two agents with controllable processing times. European Journal of Operational Research, 205(3), 528\u2013539.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"3160_CR57","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.ejor.2016.10.024","volume":"258","author":"J-Q Wang","year":"2017","unstructured":"Wang, J.-Q., Fan, G. Q., Zhang, Y., Zhang, C. W., & Leung, J. Y. T. (2017). Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes. European Journal of Operational Research, 258(2), 478\u2013490.","journal-title":"European Journal of Operational Research"},{"key":"3160_CR58","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12357","author":"J Wang","year":"2018","unstructured":"Wang, J., Zhong, D., Adeli, H., Wang, D., & Liu, M. (2018). Smart bacteria-foraging algorithm-based customized kernel support vector regression and enhanced probabilistic neural network for compaction quality assessment and control of earth-rock dam. Expert Systems. https:\/\/doi.org\/10.1111\/exsy.12357.","journal-title":"Expert Systems"},{"issue":"5","key":"3160_CR59","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1142\/S0217595916500342","volume":"33","author":"Z Wang","year":"2016","unstructured":"Wang, Z., Wei, C. M., & Wu, Y. B. (2016). Single machine two-agent scheduling with deteriorating jobs. Asia-Pacific Journal of Operational Research, 33(5), 191\u2013217.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"5","key":"3160_CR60","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1007\/s10845-011-0525-5","volume":"23","author":"WH Wu","year":"2012","unstructured":"Wu, W. H., Cheng, S. R., Wu, C. C., & Yin, Y. (2012). Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations. Journal of Intelligent Manufacturing, 23(5), 1985\u20131993.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"8","key":"3160_CR61","doi-asserted-by":"crossref","first-page":"2116","DOI":"10.1016\/j.cor.2013.02.025","volume":"40","author":"WH Wu","year":"2013","unstructured":"Wu, W. H., Xu, J., Wu, W. H., Yin, Y., Cheng, I. F., & Wu, C. C. (2013). A tabu method for a two-agent single-machine scheduling with deterioration jobs. Computers & Operations Research, 40(8), 2116\u20132127.","journal-title":"Computers & Operations Research"},{"key":"3160_CR62","doi-asserted-by":"crossref","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., Wan, L., Wu, C. C., & Liu, J. (2015). Two-agent single-machine scheduling with deteriorating jobs. Computers & Industrial Engineering, 81, 177\u2013185.","journal-title":"Computers & Industrial Engineering"},{"key":"3160_CR63","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2839-6","author":"Y Yin","year":"2018","unstructured":"Yin, Y., Li, D., Wang, D., & Cheng, T. C. E. (2018). Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-018-2839-6.","journal-title":"Annals of Operations Research"},{"key":"3160_CR64","doi-asserted-by":"crossref","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. (2016). Two-agent single-machine scheduling to minimize the batch delivery cost. Computers & Industrial Engineering, 92, 16\u201330.","journal-title":"Computers & Industrial Engineering"},{"key":"3160_CR65","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.cie.2017.12.013","volume":"116","author":"B Zhang","year":"2018","unstructured":"Zhang, B., Pan, Q. K., Gao, L., Zhang, X. L., & Chen, Q. D. (2018a). A hybrid variable neighborhood search algorithm for the hot rolling batch scheduling problem in compact strip production. Computers & Industrial Engineering, 116, 22\u201336.","journal-title":"Computers & Industrial Engineering"},{"key":"3160_CR66","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-018-0741-3","author":"CL Zhang","year":"2018","unstructured":"Zhang, C. L., Wang, J. Q., & Zhang, C. W. (2018b). Two-agent scheduling on a single parallel-batching machine to minimize the weighted sum of the agents\u2019 makespans. Journal of Ambient Intelligence and Humanized Computing. https:\/\/doi.org\/10.1007\/s12652-018-0741-3.","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"key":"3160_CR67","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.cor.2018.04.009","volume":"96","author":"SC Zhou","year":"2018","unstructured":"Zhou, S. C., Li, X. L., Du, N., Pang, Y., & Chen, H. P. (2018). A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost. Computers & Operations Research, 96, 55\u201368.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03160-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03160-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03160-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T13:00:52Z","timestamp":1605013252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03160-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,8]]},"references-count":65,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["3160"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03160-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,8]]},"assertion":[{"value":"8 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}