{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:12:36Z","timestamp":1771877556656,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T00:00:00Z","timestamp":1495411200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10951-017-0529-x","type":"journal-article","created":{"date-parts":[[2017,5,21]],"date-time":"2017-05-21T22:36:31Z","timestamp":1495406191000},"page":"235-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Family scheduling with batch availability in flow shops to minimize makespan"],"prefix":"10.1007","volume":"21","author":[{"given":"Liji","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jatinder N. D.","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,22]]},"reference":[{"key":"529_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","volume":"47","author":"S Albers","year":"1993","unstructured":"Albers, S., & Brucker, P. (1993). The complexity of one-machine batching problems. Discrete Applied Mathematics, 47, 87\u2013107.","journal-title":"Discrete Applied Mathematics"},{"key":"529_CR2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti, R., & Giampietro, T. (1994). The [reactive tabu search]. ORSA Journal on Computing, 6, 126\u2013140.","journal-title":"ORSA Journal on Computing"},{"key":"529_CR3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.ejor.2008.11.046","volume":"199","author":"U Buscher","year":"2009","unstructured":"Buscher, U., & Shen, L. (2009). An integrated tabu search algorithm for the lot streaming problem in job shops. European Journal of Operational Research, 199, 385\u2013399.","journal-title":"European Journal of Operational Research"},{"key":"529_CR4","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"HG Campbell","year":"1970","unstructured":"Campbell, H. G., Dudek, R. A., & Simth, M. L. (1970). A heuristic algorithm for the \n                        $$n$$\n                        \n                            \n                                n\n                            \n                        \n                     job \n                        $$m$$\n                        \n                            \n                                m\n                            \n                        \n                     machine sequencing problem. Management Science, 16, B630\u2013B637.","journal-title":"Management Science"},{"key":"529_CR5","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1080\/00207540412331325396","volume":"43","author":"JH Chang","year":"2005","unstructured":"Chang, J. H., & Chiu, H. N. (2005). A comprehensive review of lot streaming. International Journal of Production Research, 43, 1515\u20131536.","journal-title":"International Journal of Production Research"},{"key":"529_CR6","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/0305-0548(94)90001-9","volume":"21","author":"TCE Cheng","year":"1994","unstructured":"Cheng, T. C. E., Chen, Y. L., & Oguz, C. (1994). One-machine batching and sequencing of multiple-type items. Computers and Operations Research, 21, 717\u2013721.","journal-title":"Computers and Operations Research"},{"key":"529_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0377-2217(96)00127-0","volume":"94","author":"TCE Cheng","year":"1996","unstructured":"Cheng, T. C. E., Gordon, V. S., & Kovalyov, M. Y. (1996). Single machine scheduling with batch deliveries. European Journal of Operational Research, 94, 277\u2013283.","journal-title":"European Journal of Operational Research"},{"key":"529_CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","volume":"26","author":"EG Coffman","year":"1990","unstructured":"Coffman, E. G., Yannakakis, M., Magazine, M. J., & Santos, C. A. (1990). Batch sizing and job sequencing on a single machine. Annals of Operations Research, 26, 135\u2013147.","journal-title":"Annals of Operations Research"},{"key":"529_CR9","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.cie.2003.11.004","volume":"48","author":"PM Franca","year":"2005","unstructured":"Franca, P. M., Gupta, J. N. D., Mendes, A. S., Moscato, P., & Veltink, K. J. (2005). Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers and Industrial Engineering, 48, 491\u2013506.","journal-title":"Computers and Industrial Engineering"},{"key":"529_CR10","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"169","author":"JND Gupta","year":"2006","unstructured":"Gupta, J. N. D., & Stafford, E. F. (2006). Flowshop scheduling research after five decades. European Journal of Operational Research, 169, 699\u2013711.","journal-title":"European Journal of Operational Research"},{"key":"529_CR11","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0377-2217(94)90407-3","volume":"77","author":"JND Gupta","year":"1994","unstructured":"Gupta, J. N. D., & Tunc, E. A. (1994). Scheduling a two-stage hybrid flowshop with separable setup and removal times. European Journal of Operational Research, 77, 415\u2013428.","journal-title":"European Journal of Operational Research"},{"key":"529_CR12","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1023\/A:1024042209719","volume":"6","author":"NG Hall","year":"2003","unstructured":"Hall, N. G., Laporte, G., Selvarajah, E., & Sriskandarajah, C. (2003). Scheduling and lot streaming in [flowshops with no-wait] in process. Journal of Scheduling, 6, 339\u2013354.","journal-title":"Journal of Scheduling"},{"key":"529_CR13","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ijpe.2007.02.031","volume":"111","author":"SH Hendizadeh","year":"2008","unstructured":"Hendizadeh, S. H., Faramarzi, H., Mansouri, S. A., Gupta, J. N. D., & Eimekkawy, T. Y. (2008). Mata-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times. International Journal of Production Economics, 111, 593\u2013605.","journal-title":"International Journal of Production Economics"},{"key":"529_CR14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(94)90063-9","volume":"16","author":"DS Hochbaum","year":"1994","unstructured":"Hochbaum, D. S., & Landy, D. (1994). Scheduling with batching: Minimizing the weighted number of tardy jobs. Operations Research Letters, 16, 79\u201386.","journal-title":"Operations Research Letters"},{"key":"529_CR15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<127::AID-JOS11>3.0.CO;2-9","volume":"1","author":"J Hurink","year":"1998","unstructured":"Hurink, J. (1998). A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbor. Journal of Scheduling, 1, 127\u2013148.","journal-title":"Journal of Scheduling"},{"key":"529_CR16","doi-asserted-by":"crossref","first-page":"3205","DOI":"10.1080\/00207540701813210","volume":"47","author":"SW Lin","year":"2009","unstructured":"Lin, S. W., Gupta, J. N. D., Ying, K. C., & Lee, Z. J. (2009). Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times. International Journal of Production Research, 47, 3205\u20133217.","journal-title":"International Journal of Production Research"},{"key":"529_CR17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ijpe.2005.02.006","volume":"102","author":"R Logendran","year":"2006","unstructured":"Logendran, R., de Szoeke, P., & Barnard, F. (2006). Sequence-dependent group scheduling problems in flexible flow shops. International Journal of Production Economics, 102, 66\u201386.","journal-title":"International Journal of Production Economics"},{"key":"529_CR18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.ejor.2003.09.010","volume":"161","author":"G Mosheiov","year":"2005","unstructured":"Mosheiov, G., & Oron, D. (2005). A note on flow-shop and job-shop batch scheduling with identical processing-time jobs. European Journal of Operational Research, 161, 285\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"529_CR19","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1016\/j.ejor.2006.03.068","volume":"187","author":"G Mosheiov","year":"2008","unstructured":"Mosheiov, G., & Oron, D. (2008). Open-shop batch scheduling with identical jobs. European Journal of Operational Research, 187, 1282\u20131292.","journal-title":"European Journal of Operational Research"},{"key":"529_CR20","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1002\/nav.20028","volume":"51","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov, G., Oron, D., & Ritov, Y. (2004). Flow-shop batching scheduling with identical processing-time jobs. Naval Research Logistics, 51, 783\u2013799.","journal-title":"Naval Research Logistics"},{"key":"529_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E., & Ham, I. (1983). A heuristic algorithm for the \n                        $$m$$\n                        \n                            \n                                m\n                            \n                        \n                    -machine, \n                        $$n$$\n                        \n                            \n                                n\n                            \n                        \n                    -job flow shop sequencing problem. OMEGA International Journal of Management Science, 11, 91\u201395.","journal-title":"OMEGA International Journal of Management Science"},{"key":"529_CR22","doi-asserted-by":"crossref","first-page":"1791","DOI":"10.1080\/00207543.2014.961209","volume":"53","author":"JS Neufeld","year":"2015","unstructured":"Neufeld, J. S., Gupta, J. N. D., & Buscher, U. (2015). Minimizing makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle times. International Journal of Production Research, 53, 1791\u20131806.","journal-title":"International Journal of Production Research"},{"key":"529_CR23","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","volume":"70","author":"JS Neufeld","year":"2016","unstructured":"Neufeld, J. S., Gupta, J. N. D., & Buscher, U. (2016). A comprehensive review of flowshop group scheduling literature. Computers and Operations Research, 70, 56\u201374.","journal-title":"Computers and Operations Research"},{"key":"529_CR24","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42, 797\u2013813.","journal-title":"Management Science"},{"key":"529_CR25","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"529_CR26","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1080\/00207540210163973","volume":"41","author":"V Reddy","year":"2003","unstructured":"Reddy, V., & Narendran, T. T. (2003). Heuristics for scheduling sequence-dependent set-up jobs in flow line cells. International Journal of Production Research, 41, 193\u2013206.","journal-title":"International Journal of Production Research"},{"key":"529_CR27","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/S0377-2217(99)00387-2","volume":"125","author":"JE Schaller","year":"2000","unstructured":"Schaller, J. E., Gupta, J. N. D., & Vakharia, A. J. (2000). Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research, 125, 324\u2013339.","journal-title":"European Journal of Operational Research"},{"key":"529_CR28","unstructured":"Shen, L., Gupta, J.N.D. (2015) Family scheduling with batch availability in flow shops. In Proceedings of the 7th multidisciplinary international scheduling conference."},{"key":"529_CR29","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10951-014-0369-x","volume":"17","author":"L Shen","year":"2014","unstructured":"Shen, L., Gupta, J. N. D., & Buscher, U. (2014). Flow shop batching and scheduling with sequence-dependent setup times. Journal of Scheduling, 17, 353\u2013370.","journal-title":"Journal of Scheduling"},{"key":"529_CR30","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0377-2217(99)00031-4","volume":"121","author":"CS Sung","year":"2000","unstructured":"Sung, C. S., Kim, Y. H., & Yoon, S. H. (2000). A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines. European Journal of Operational Research, 121, 179\u2013192.","journal-title":"European Journal of Operational Research"},{"key":"529_CR31","doi-asserted-by":"crossref","first-page":"3643","DOI":"10.1080\/00207543.2012.756590","volume":"51","author":"D Zee van der","year":"2013","unstructured":"van der Zee, D. (2013). Family based dispatching with batch availability. International Journal of production Research, 51, 3643\u20133653.","journal-title":"International Journal of production Research"},{"key":"529_CR32","doi-asserted-by":"crossref","unstructured":"van Hoesel, S., Wagelmans, A., & Moerman, B. (1994). Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problems and extensions. European Journal of Operational Research, 75, 312\u2013331.","DOI":"10.1016\/0377-2217(94)90077-9"},{"key":"529_CR33","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster, S., & Baker, K. R. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43, 692\u2013703.","journal-title":"Operations Research"},{"key":"529_CR34","doi-asserted-by":"crossref","first-page":"2169","DOI":"10.1080\/00207540802534707","volume":"48","author":"KC Ying","year":"2010","unstructured":"Ying, K. C., Gupta, J. N. D., Lin, S. W., & Lee, Z. J. (2010). Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups. International Journal of Production Research, 48, 2169\u20132184.","journal-title":"International Journal of Production Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0529-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0529-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0529-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T10:29:34Z","timestamp":1520332174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0529-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,22]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["529"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0529-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,22]]}}}