{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:06:50Z","timestamp":1649023610843},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,2,15]],"date-time":"2015-02-15T00:00:00Z","timestamp":1423958400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10472-015-9449-7","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T04:05:52Z","timestamp":1424145952000},"page":"215-228","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types"],"prefix":"10.1007","volume":"76","author":[{"given":"Jun","family":"Pei","sequence":"first","affiliation":[]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wenjuan","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Athanasios","family":"Migdalas","sequence":"additional","affiliation":[]},{"given":"Shanlin","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,15]]},"reference":[{"issue":"9-12","key":"9449_CR1","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1007\/s00170-011-3442-z","volume":"58","author":"P Damodaran","year":"2012","unstructured":"Damodaran, P., Diyadawagamage, D.A., Ghrayeb, O., V\u00e9lez-Gallego, M.C.: A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines. Int. J. Adv. Manuf. Technol. 58(9-12), 1131\u20131140 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"9449_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10951-013-0340-2","volume":"17","author":"MA Aloulou","year":"2014","unstructured":"Aloulou, M.A., Bouzaiene, A., Dridi, N., Vanderpooten, D.: A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. J. Sched. 17(1), 17\u201329 (2014)","journal-title":"J. Sched."},{"issue":"4","key":"9449_CR3","first-page":"323","volume":"31","author":"CT Ng","year":"2003","unstructured":"Ng, C.T., Cheng, T.C.E., Yuan, J.J., Liu, Z.H.: On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. Oper. Res. Lett. 31(4), 323\u2013326 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9449_CR4","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0377-2217(03)00361-8","volume":"158","author":"JJ Yuan","year":"2004","unstructured":"Yuan, J.J., Yang, A.F., Cheng, T.C.E.: A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times. Eur. J. Oper. Res. 158(2), 525\u2013528 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9449_CR5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10479-013-1339-y","volume":"206","author":"L Shen","year":"2013","unstructured":"Shen, L., M\u00f6nch, L., Buscher, U.: An iterative approach for the serial batching problem with parallel machines and job families. Ann. Oper. Res. 206(1), 425\u2013448 (2013)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9449_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10951-013-0340-2","volume":"17","author":"MA Aloulou","year":"2014","unstructured":"Aloulou, M.A., Bouzaiene, A., Dridi, N., Vanderpooten, D.: A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. J. Sched. 17(1), 17\u201329 (2014)","journal-title":"J. Sched."},{"issue":"1","key":"9449_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2013.08.013","volume":"233","author":"D Shabtay","year":"2014","unstructured":"Shabtay, D.: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur. J. Oper. Res. 233(1), 64\u201374 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"9449_CR8","doi-asserted-by":"crossref","unstructured":"Pei, J., Liu, X., Pardalos, P.M., Fan, W., Yang, S.: Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. Optimization Letters 9(1), 91\u2013104 (2015)","DOI":"10.1007\/s11590-014-0740-z"},{"key":"9449_CR9","doi-asserted-by":"crossref","unstructured":"Pei, J., Pardalos, P.M., Liu, X., Fan, W., Yang, S.: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. Eur. J. Oper. Res (2014). doi: 10.1016\/j.ejor.2014.11.034","DOI":"10.1016\/j.ejor.2014.11.034"},{"issue":"3-4","key":"9449_CR10","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/s00170-005-0194-7","volume":"31","author":"F-D Chou","year":"2006","unstructured":"Chou, F.-D., Chang, P.-C., Wang, H.-M.: A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem. Int. J. Adv. Manuf. Technol. 31(3-4), 350\u2013359 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"9449_CR11","doi-asserted-by":"crossref","first-page":"825","DOI":"10.3934\/jimo.2011.7.825","volume":"7","author":"G Sahin","year":"2011","unstructured":"Sahin, G., Ahuja, R.K.: Single-machine scheduling with stepwise tardiness costs and release times. J. Ind. Manag. Optim. 7(4), 825\u2013848 (2011)","journal-title":"J. Ind. Manag. Optim."},{"issue":"5-8","key":"9449_CR12","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s00170-011-3634-6","volume":"60","author":"M-S Lu","year":"2012","unstructured":"Lu, M.-S., Romanowski, R.: Multi-contextual ant colony optimization of intermediate dynamic job shop problems. Int. J. Adv. Manuf. Technol. 60(5-8), 667\u2013681 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1-4","key":"9449_CR13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00170-013-4765-8","volume":"67","author":"M-S Lu","year":"2013","unstructured":"Lu, M.-S., Romanowski, R.: Multicontextual dispatching rules for job shops with dynamic job arrival. Int. J. Adv. Manuf. Technol. 67(1-4), 19\u201333 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"9449_CR14","doi-asserted-by":"crossref","unstructured":"Hosseini, N., Tavakkoli-Moghaddam, R.: Two meta-heuristics for solving a new two-machine flowshop scheduling problem with the learning effect and dynamic arrivals 65(5-8), 771\u2013786 (2013)","DOI":"10.1007\/s00170-012-4216-y"},{"issue":"1","key":"9449_CR15","doi-asserted-by":"crossref","first-page":"185","DOI":"10.3934\/jimo.2015.11.185","volume":"11","author":"J Tao","year":"2015","unstructured":"Tao, J., Huang, R., Liu, T.: A 2:28-competitive algorithm for online scheduling on identical machines. J. Ind. Manag. Optim. 11(1), 185\u2013198 (2015)","journal-title":"J. Ind. Manag. Optim."},{"issue":"7","key":"9449_CR16","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1002\/nav.10091","volume":"50","author":"ZL Chen","year":"2003","unstructured":"Chen, Z.L., Powell, W.B.: Exact algorithms for scheduling multiple families of jobs on parallel machines. Nav. Res. Logist. 50(7), 823\u2013840 (2003)","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"9449_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10479-012-1107-4","volume":"213","author":"A Obeid","year":"2014","unstructured":"Obeid, A., Dauzere-Peres, S., Yugma, C.: Scheduling job families on non-identical parallel machines with time constraints. Ann. Oper. Res. 213(1), 221\u2013234 (2014)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"9449_CR18","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1007\/s11590-013-0650-5","volume":"8","author":"W Li","year":"2014","unstructured":"Li, W., Yuan, J.: Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs. Optimization Letters 8(5), 1691\u20131706 (2014)","journal-title":"Optimization Letters"},{"issue":"1-4","key":"9449_CR19","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.: Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain. Int. J. Adv. Manuf. Technol. 70(1-4), 335\u2013348 (2014)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"9449_CR20","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., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"9449_CR21","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-319-09584-4_23","volume":"8426","author":"J Pei","year":"2014","unstructured":"Pei, J., Liu, X., Fan, W., Pardalos, P.M., Liu, L.: A novel hybrid dynamic programming algorithm for a two-stage supply chain scheduling problem. Lect. Notes Comput. Sci. 8426, 242\u2013257 (2014)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9449_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/11730095","volume-title":"Evolutionary Computation in Combinatorial Optimization: 6th European Conference Proceedings","author":"J Gottlieb","year":"2006","unstructured":"Gottlieb, J., Raidl, G.R.: Evolutionary Computation in Combinatorial Optimization: 6th European Conference Proceedings. Springer, Berlin Heidelberg New York (2006)"},{"issue":"1","key":"9449_CR23","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ijpe.2004.10.001","volume":"98","author":"SG Koh","year":"2005","unstructured":"Koh, S.G., Koo, P.H., Kim, D.C., Hur, W.S.: Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. Int. J. Prod. Econ. 98(1), 81\u201396 (2005)","journal-title":"Int. J. Prod. Econ."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9449-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-015-9449-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9449-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T20:08:53Z","timestamp":1566331733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-015-9449-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,15]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9449"],"URL":"https:\/\/doi.org\/10.1007\/s10472-015-9449-7","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,15]]}}}