{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:51:44Z","timestamp":1776750704474,"version":"3.51.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,12]],"date-time":"2013-04-12T00:00:00Z","timestamp":1365724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10845-013-0771-9","type":"journal-article","created":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T22:17:36Z","timestamp":1365632256000},"page":"169-187","source":"Crossref","is-referenced-by-count":14,"title":["Active scheduling for hybrid flowshop with family setup time and inconsistent family formation"],"prefix":"10.1007","volume":"26","author":[{"given":"Hao","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George Q.","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,12]]},"reference":[{"issue":"3","key":"771_CR1","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985\u20131032.","journal-title":"European Journal of Operational Research"},{"key":"771_CR2","volume-title":"Genetic algorithms and engineering design","author":"M Gen","year":"1997","unstructured":"Gen, M., & Cheng, R. (1997). Genetic algorithms and engineering design. New York: Wiley."},{"key":"771_CR3","unstructured":"Goldgerg, D., & Lingle, R. (1985). Alleles, loci, and the traveling salesman problem. Hillsdale: Paper presented at the First international Conference on Genetic Algorithms and their Applications."},{"issue":"2","key":"771_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1057\/palgrave.jors.2601971","volume":"57","author":"JND Gupta","year":"2005","unstructured":"Gupta, J. N. D., & Schaller, J. E. (2005). Minimizing flow time in a flow-line manufacturing cell with family setup times. Journal of the Operational Research Society, 57(2), 163\u2013176.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"771_CR5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1243\/09544054JEM1318","volume":"223","author":"H-W Kim","year":"2009","unstructured":"Kim, H.-W., & Lee, D.-H. (2009). Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 223(4), 433\u2013442.","journal-title":"Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture"},{"key":"771_CR6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10479-004-5029-7","volume":"133","author":"BMT Lin","year":"2005","unstructured":"Lin, B. M. T., & Cheng, T. C. E. (2005). Two-machine flowshop batching and scheduling. Annals of Operations Research, 133, 149\u2013161.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"771_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.ijpe.2004.03.011","volume":"96","author":"R Logendran","year":"2005","unstructured":"Logendran, R., Carson, S., & Hanson, E. (2005). Group scheduling in flexible flow shops. International Journal of Production Economics, 96(2), 143\u2013155.","journal-title":"International Journal of Production Economics"},{"key":"771_CR8","doi-asserted-by":"crossref","unstructured":"Logendran, R., deSzoeke, P., & Barnard, F. (2006). Sequence-dependent group scheduling problems in flexible flow shops. International Journal of Production Economics, 102(1), 66\u201386.","DOI":"10.1016\/j.ijpe.2005.02.006"},{"key":"771_CR9","doi-asserted-by":"crossref","unstructured":"Luo, H., Huang, G. Q., Shi, Y., Qu, T., & Zhang, Y. (2012). Hybrid flowshop scheduling with family setup time and inconsistent family formation. International Journal of Production Research, 50(6), 1457\u20131475.","DOI":"10.1080\/00207543.2011.560620"},{"issue":"1","key":"771_CR10","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.cor.2007.07.001","volume":"36","author":"JJM Mendes","year":"2009","unstructured":"Mendes, J. J. M., Gon\u00e7alves, J. F., & Resende, M. G. C. (2009). A random key based genetic algorithm for the resource constrained project scheduling problem. Computers & Operations Research, 36(1), 92\u2013109.","journal-title":"Computers & Operations Research"},{"key":"771_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic algorithms+data structures=evolution programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z. (1996). Genetic algorithms+data structures=evolution programs. Berlin: Springer."},{"issue":"6","key":"771_CR12","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s10845-009-0373-8","volume":"22","author":"H Mirsanei","year":"2011","unstructured":"Mirsanei, H., Zandieh, M., Moayed, M., & Khabbazi, M. (2011). A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. Journal of Intelligent Manufacturing, 22(6), 965\u2013978.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"771_CR13","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2008","unstructured":"Pinedo, M. L. (2008). Scheduling: Theory, algorithms, and systems (3rd ed.). Berlin: Springer.","edition":"3"},{"issue":"5","key":"771_CR14","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00170-011-3206-9","volume":"56","author":"N Salmasi","year":"2011","unstructured":"Salmasi, N., Logendran, R., & Skandari, M. (2011). Makespan minimization of a flowshop sequence-dependent group scheduling problem. The International Journal of Advanced Manufacturing Technology, 56(5), 699\u2013710.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"771_CR15","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0377-2217(93)E0294-8","volume":"80","author":"A Sprecher","year":"1995","unstructured":"Sprecher, A., Kolisch, R., & Drexl, A. (1995). Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research, 80(1), 94\u2013102.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"771_CR16","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s10845-009-0250-5","volume":"21","author":"M Zandieh","year":"2010","unstructured":"Zandieh, M., Mozaffari, E., & Gholami, M. (2010). A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. Journal of Intelligent Manufacturing, 21(6), 731\u2013743.","journal-title":"Journal of Intelligent Manufacturing"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0771-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-013-0771-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0771-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:11:57Z","timestamp":1559254317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-013-0771-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["771"],"URL":"https:\/\/doi.org\/10.1007\/s10845-013-0771-9","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,12]]}}}