{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:05:41Z","timestamp":1648980341732},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T00:00:00Z","timestamp":1422921600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11590-015-0859-6","type":"journal-article","created":{"date-parts":[[2015,2,2]],"date-time":"2015-02-02T08:33:58Z","timestamp":1422866038000},"page":"109-118","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines"],"prefix":"10.1007","volume":"10","author":[{"given":"Jianming","family":"Dong","sequence":"first","affiliation":[]},{"given":"Jueliang","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,3]]},"reference":[{"key":"859_CR1","doi-asserted-by":"crossref","first-page":"3161","DOI":"10.1016\/j.apm.2011.09.061","volume":"36","author":"B Cheng","year":"2012","unstructured":"Cheng, B., Yang, S., Hu, X., Chen, B.: Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes. Appl. Math. Model. 36, 3161\u20133167 (2012)","journal-title":"Appl. Math. Model."},{"key":"859_CR2","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1080\/00207721.2012.724107","volume":"45","author":"B Cheng","year":"2014","unstructured":"Cheng, B., Yang, S., Hu, X., Li, K.: Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes. Int. J. Syst. Sci. 45, 571\u2013578 (2014)","journal-title":"Int. J. Syst. Sci."},{"key":"859_CR3","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/S0305-0548(00)00078-2","volume":"29","author":"L Dupont","year":"2002","unstructured":"Dupont, L., Flipo, C.D.: Minimizing the makespan on a batch machine with arbitrary job sizes: an exact procedure. Comput. Oper. Res. 29, 807\u2013819 (2002)","journal-title":"Comput. Oper. Res."},{"key":"859_CR4","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 and Company, San Francisco (1979)"},{"key":"859_CR5","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, R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"859_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y Ikura","year":"1986","unstructured":"Ikura, Y., Gimple, M.: Scheduling algorithms for a single batching processing machine. Oper. Res. Lett. 5, 61\u201365 (1986)","journal-title":"Oper. Res. Lett."},{"key":"859_CR7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ejor.2009.05.021","volume":"202","author":"M Ji","year":"2010","unstructured":"Ji, M., Cheng, T.C.E.: Batch scheduling simple linear deterioration jobs on a single machine to minimize makespan. Eur. J. Oper. Res. 202, 90\u201398 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"859_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-machine production schedules with setup times included. Naval Res. Logist. 1, 61\u201368 (1954)","journal-title":"Naval Res. Logist."},{"key":"859_CR9","doi-asserted-by":"crossref","first-page":"2754","DOI":"10.1016\/j.tcs.2009.02.014","volume":"410","author":"AH Kashan","year":"2009","unstructured":"Kashan, A.H., Karimi, B., Ghomi, F.: A note minimizing makespan on a single batch processing machine with nonidentical job sizes. Theor. Comput. Sci. 410, 2754\u20132758 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"859_CR10","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1016\/j.cor.2006.07.005","volume":"35","author":"AH Kashan","year":"2008","unstructured":"Kashan, A.H., Karimi, B., Jenabi, M.: A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Comput. Oper. Res. 35, 1084\u20131098 (2008)","journal-title":"Comput. Oper. Res."},{"key":"859_CR11","doi-asserted-by":"crossref","unstructured":"Kashan, A.H., Karimi, B., Jolai, F.: Minimizing makespan on a single batch processing machine with non-identical job sizes: A hybrid genetic approach. In: Proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2006), LNCS 3906. pp 135\u2013146 (2006)","DOI":"10.1007\/11730095_12"},{"key":"859_CR12","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C-Y Lee","year":"1992","unstructured":"Lee, C.-Y., Uzsoy, R., Martin, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40, 764\u2013775 (1992)","journal-title":"Oper. Res."},{"key":"859_CR13","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/0377-2217(95)00332-0","volume":"96","author":"CL Li","year":"1997","unstructured":"Li, C.L., Lee, C.-Y.: Scheduling with agreeable release times and due dates on a batch processing machine. Eur. J. Oper. Res. 96, 564\u2013569 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"859_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.orl.2004.04.009","volume":"33","author":"S Li","year":"2005","unstructured":"Li, S., Li, G., Wang, X., Liu, Q.: Minimizing makespan on a single batch processing machine with release times and arbitrary job sizes. Oper. Res. Lett. 33, 157\u2013164 (2005)","journal-title":"Oper. Res. Lett."},{"key":"859_CR15","doi-asserted-by":"crossref","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 times to minimize the makespan. Eur. J. Oper. Res. 210, 482\u2013488 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"859_CR16","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.compchemeng.2006.02.008","volume":"30","author":"CA M\u00e9ndez","year":"2006","unstructured":"M\u00e9ndez, C.A., Cerd\u00e1, J., Grossmann, I.E., Harjunkoski, I., Fahl, M.: State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput. Chem. Eng. 30, 913\u2013946 (2006)","journal-title":"Comput. Chem. Eng."},{"key":"859_CR17","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/msom.1040.0045","volume":"6","author":"K Rajaram","year":"2004","unstructured":"Rajaram, K., Karmarkar, U.S.: Campaign planning and scheduling for multiproduct batch operations with applications to the food-processing industry. Manuf. Serv. Oper. Manag. 6, 253\u2013269 (2004)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"859_CR18","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.mcm.2008.09.012","volume":"49","author":"L Tang","year":"2009","unstructured":"Tang, L., Liu, P.: Minimizing makespan in a two-machine flowshop scheduling with batching and release time. Math. Comput. Model. 49, 1071\u20131077 (2009)","journal-title":"Math. Comput. Model."},{"key":"859_CR19","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1080\/00207720903308389","volume":"42","author":"L Tang","year":"2011","unstructured":"Tang, L., Zhang, Y.: A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates. Int. J. Syst. Sci. 42, 1133\u20131141 (2011)","journal-title":"Int. J. Syst. Sci."},{"key":"859_CR20","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R.: Scheduling a single batch processing machine with non-identical job sizes. Int. J. Prod. Res. 32, 1615\u20131635 (1994)","journal-title":"Int. J. Prod. Res."},{"key":"859_CR21","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.1016\/j.dam.2010.05.026","volume":"158","author":"B Xia","year":"2010","unstructured":"Xia, B., Tan, Z.: Tighter bounds of the first fit algorithm for the bin-packing problem. Discrete Appl. Math. 158, 1668\u20131675 (2010)","journal-title":"Discrete Appl. Math."},{"key":"859_CR22","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"G Zhang","year":"2001","unstructured":"Zhang, G., Cai, X., Lee, C.-Y., Wong, C.K.: Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Res. Logist. 48, 226\u2013240 (2001)","journal-title":"Naval Res. Logist."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0859-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0859-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0859-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T12:16:56Z","timestamp":1566303416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0859-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["859"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0859-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,3]]}}}