{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:06:27Z","timestamp":1743015987130,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319095837"},{"type":"electronic","value":"9783319095844"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-09584-4_23","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T12:00:41Z","timestamp":1406808041000},"page":"242-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Hybrid Dynamic Programming Algorithm for a Two-Stage Supply Chain Scheduling Problem"],"prefix":"10.1007","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":"Lin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,1]]},"reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"NG Hall","year":"2003","unstructured":"Hall, N.G., Potts, C.N.: Supply chain scheduling: batching and delivery. Oper. Res. 51(4), 566\u2013584 (2003)","journal-title":"Oper. Res."},{"key":"23_CR2","volume-title":"Applications of Supply Chain Management and E-commerce Research in Industry","author":"E Alcali","year":"2004","unstructured":"Alcali, E., Geunes, J., Pardalos, P.M., Romeijn, H.E., Shen, Z.J.: Applications of Supply Chain Management and E-commerce Research in Industry. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2008.07.044","volume":"198","author":"VS Gordon","year":"2009","unstructured":"Gordon, V.S., Strusevich, V.A.: Single machine scheduling and due date assignment with positionally dependent processing times. Eur. J. Oper. Res. 198(1), 57\u201362 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1016\/j.cor.2009.10.001","volume":"37","author":"TCE Cheng","year":"2010","unstructured":"Cheng, T.C.E., Wang, X.: Machine scheduling with job class setup and delivery considerations. Comput. Oper. Res. 37(6), 1123\u20131128 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2010.11.021","volume":"210","author":"S Li","year":"2011","unstructured":"Li, S., Ng, C.T., Cheng, T.C.E., Yuan, J.: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. Eur. J. Oper. Res. 210(3), 482\u2013488 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.ijpe.2011.04.012","volume":"132","author":"WK Yeung","year":"2011","unstructured":"Yeung, W.K., Choi, T.M., Cheng, T.C.E.: Supply chain scheduling and coordination with dual delivery modes and inventory storage cost. Int. J. Prod. Econ. 132(2), 223\u2013229 (2011)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.disopt.2011.11.001","volume":"9","author":"FJ Hwang","year":"2012","unstructured":"Hwang, F.J., Kovalyov, M.Y., Lin, B.M.T.: Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. Discret. Optim. 9(1), 29\u201339 (2012)","journal-title":"Discret. Optim."},{"issue":"6","key":"23_CR8","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1057\/jors.2011.90","volume":"63","author":"FJ Hwang","year":"2012","unstructured":"Hwang, F.J., Lin, B.M.T.: Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence. J. Oper. Res. Soc. 63(6), 839\u2013845 (2012)","journal-title":"J. Oper. Res. Soc."},{"key":"23_CR9","volume-title":"Supply Chain Optimization","author":"J Geunes","year":"2003","unstructured":"Geunes, J., Pardalos, P.M.: Supply Chain Optimization. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ejor.2003.08.017","volume":"159","author":"V Agrawal","year":"2004","unstructured":"Agrawal, V., Chao, X., Seshadri, S.: Dynamic balancing of inventory in supply chains. Eur. J. Oper. Res. 159(2), 296\u2013317 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10589-008-9206-5","volume":"47","author":"PM Pardalos","year":"2010","unstructured":"Pardalos, P.M., Shylo, O.V., Vazacopoulos, A.: Solving job shop scheduling problems utilizing the properties of backbone and \u201cbig valley\u201d. Comput. Optim. Appl. 47(1), 61\u201376 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"9","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1016\/j.cor.2010.10.018","volume":"38","author":"H Gong","year":"2011","unstructured":"Gong, H., Tang, L.: Two-machine flowshop scheduling with intermediate transportation under job physical space consideration. Comput. Oper. Res. 38(9), 1267\u20131274 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ejor.2006.06.004","volume":"181","author":"I Averbakh","year":"2007","unstructured":"Averbakh, I., Xue, Z.: On-line supply chain scheduling problems with preemption. Eur. J. Oper. Res. 181(1), 500\u2013504 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"23_CR14","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1007\/s00170-007-1298-z","volume":"39","author":"H Kim","year":"2008","unstructured":"Kim, H., Jeong, H., Park, J.: Integrated model for production planning and scheduling in a supply chain using benchmarked genetic algorithm. Int. J. Adv. Manuf. Technol. 39(11), 1207\u20131226 (2008)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"22","key":"23_CR15","doi-asserted-by":"publisher","first-page":"11100","DOI":"10.1016\/j.amc.2012.04.066","volume":"218","author":"PS You","year":"2012","unstructured":"You, P.S., Hsieh, Y.C.: A heuristic approach to a single stage assembly problem with transportation allocation. Appl. Math. Comput. 218(22), 11100\u201311111 (2012)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/j.ijpe.2011.11.011","volume":"135","author":"Y Mehravaran","year":"2012","unstructured":"Mehravaran, Y., Logendran, R.: Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times. Int. J. Prod. Econ. 135(2), 953\u2013963 (2012)","journal-title":"Int. J. Prod. Econ."},{"key":"23_CR17","doi-asserted-by":"publisher","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":"23_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Evolutionary Computation in Combinatorial Optimization","year":"2006","unstructured":"Gottlieb, J., Raidl, G.R. (eds.): EvoCOP 2006. LNCS, vol. 3906. Springer, Heidelberg (2006)"},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","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":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09584-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T05:41:41Z","timestamp":1676871701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09584-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319095837","9783319095844"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09584-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"1 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}