{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:06:16Z","timestamp":1771023976592,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T00:00:00Z","timestamp":1530230400000},"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":["J Sched"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10951-018-0572-2","type":"journal-article","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T02:12:05Z","timestamp":1530238325000},"page":"545-563","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["A new algorithm based on evolutionary computation for hierarchically coupled constraint optimization: methodology and application to assembly job-shop scheduling"],"prefix":"10.1007","volume":"21","author":[{"given":"Pan","family":"Zou","sequence":"first","affiliation":[]},{"given":"Manik","family":"Rajora","sequence":"additional","affiliation":[]},{"given":"Steven Y.","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"issue":"11","key":"572_CR1","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CAC Coello","year":"2002","unstructured":"Coello, C. A. C. (2002). Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering, 191(11), 1245\u20131287.","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"key":"572_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-39883-7_3","volume-title":"Evolutionary computations","author":"K Watanabe","year":"2004","unstructured":"Watanabe, K., & Hashem, M. M. A. (2004). Evolutionary optimization of constrained problems. In K. Watanabe & M. M. A. Hashem (Eds.), Evolutionary computations (pp. 53\u201364). Berlin: Springer."},{"issue":"3","key":"572_CR3","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1080\/02331934.2012.655691","volume":"63","author":"MM Ali","year":"2014","unstructured":"Ali, M. M., Golalikhani, M., & Zhuang, J. (2014). A computational study on different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method. Optimization, 63(3), 403\u2013419.","journal-title":"Optimization"},{"issue":"8","key":"572_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/0307-904X(94)90307-7","volume":"18","author":"JA Snyman","year":"1994","unstructured":"Snyman, J. A., Stander, N., & Roux, W. J. (1994). A dynamic penalty function method for the solution of structural optimization problems. Applied Mathematical Modelling, 18(8), 453\u2013460.","journal-title":"Applied Mathematical Modelling"},{"issue":"1","key":"572_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1162\/evco.1999.7.1.19","volume":"7","author":"S Koziel","year":"1999","unstructured":"Koziel, S., & Michalewicz, Z. (1999). Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evolutionary Computation, 7(1), 19\u201344.","journal-title":"Evolutionary Computation"},{"key":"572_CR6","doi-asserted-by":"crossref","unstructured":"Monson, C. K., & Seppi, K. D. (2005). Linear equality constraints and homomorphous mappings in PSO. In 2005 IEEE congress on evolutionary computation (Vol. 1, pp. 73\u201380).","DOI":"10.1109\/CEC.2005.1554669"},{"issue":"12es","key":"572_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/272682.272711","volume":"39","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z., & Janikow, C. Z. (1996). GENOCOP: A genetic algorithm for numerical optimization problems with linear constraints. Communications of the ACM, 39(12es), 175.","journal-title":"Communications of the ACM"},{"issue":"8","key":"572_CR8","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1016\/j.cor.2005.02.002","volume":"33","author":"P Chootinan","year":"2006","unstructured":"Chootinan, P., & Chen, A. (2006). Constraint handling in genetic algorithms using a gradient-based repair method. Computers & Operations Research, 33(8), 2263\u20132281.","journal-title":"Computers & Operations Research"},{"key":"572_CR9","doi-asserted-by":"crossref","unstructured":"Pal, K., Saha, C., Das, S., & Coello, C. A. C. (2013). Dynamic constrained optimization with offspring repair based gravitational search algorithm. In 2013 IEEE congress on evolutionary computation (pp. 2414\u20132421).","DOI":"10.1109\/CEC.2013.6557858"},{"key":"572_CR10","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z., & Nazhiyath, G. (1995). Genocop III: A co-evolutionary algorithm for numerical optimization problems with nonlinear constraints. In IEEE international conference on evolutionary computation, 1995 (Vol. 2, pp. 647\u2013651).","DOI":"10.1109\/ICEC.1995.487460"},{"key":"572_CR11","doi-asserted-by":"crossref","unstructured":"Ameca-Alducin, M. Y., Mezura-Montes, E., & Cruz-Ram\u00edrez, N. (2015). A repair method for differential evolution with combined variants to solve dynamic constrained optimization problems. In Proceedings of the 2015 annual conference on genetic and evolutionary computation (pp. 241\u2013248).","DOI":"10.1145\/2739480.2754786"},{"issue":"2","key":"572_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2), 311\u2013338.","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"issue":"3","key":"572_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.engappai.2010.08.005","volume":"24","author":"H Ma","year":"2011","unstructured":"Ma, H., & Simon, D. (2011). Blended biogeography-based optimization for constrained optimization. Engineering Applications of Artificial Intelligence, 24(3), 517\u2013525.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"4","key":"572_CR14","first-page":"160","volume":"89","author":"H Chen","year":"2013","unstructured":"Chen, H., Zhou, Y., Guo, P., Ouyang, X., He, S., & Zheng, H. (2013). A hybrid invasive weed optimization with feasibility-based rule for constrained optimization problem. Przegl\u0105d Elektrotechniczny, 89(4), 160\u2013167.","journal-title":"Przegl\u0105d Elektrotechniczny"},{"issue":"1","key":"572_CR15","doi-asserted-by":"publisher","first-page":"379","DOI":"10.12785\/amis\/070147","volume":"7","author":"Y Zhou","year":"2013","unstructured":"Zhou, Y., Zhou, G., & Zhang, J. (2013). A hybrid glowworm swarm optimization algorithm for constrained engineering design problems. Applied Mathematics & Information Sciences, 7(1), 379\u2013388.","journal-title":"Applied Mathematics & Information Sciences"},{"key":"572_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ins.2012.01.008","volume":"194","author":"AW Mohamed","year":"2012","unstructured":"Mohamed, A. W., & Sabry, H. Z. (2012). Constrained optimization based on modified differential evolution algorithm. Information Sciences, 194, 171\u2013208.","journal-title":"Information Sciences"},{"issue":"1","key":"572_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.apm.2013.06.005","volume":"38","author":"P Fattahi","year":"2014","unstructured":"Fattahi, P., Hosseini, S. M. H., Jolai, F., & Tavakkoli-Moghaddam, R. (2014). A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations. Applied Mathematical Modelling, 38(1), 119\u2013134.","journal-title":"Applied Mathematical Modelling"},{"key":"572_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jocs.2015.03.011","volume":"8","author":"GM Komaki","year":"2015","unstructured":"Komaki, G. M., & Kayvanfar, V. (2015). Grey Wolf optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time. Journal of Computational Science, 8, 109\u2013120.","journal-title":"Journal of Computational Science"},{"issue":"19","key":"572_CR19","doi-asserted-by":"publisher","first-page":"5626","DOI":"10.1080\/00207543.2014.894257","volume":"52","author":"HS Yan","year":"2014","unstructured":"Yan, H. S., Wan, X. Q., & Xiong, F. L. (2014). A hybrid electromagnetism-like algorithm for two-stage assembly flow shop scheduling problem. International Journal of Production Research, 52(19), 5626\u20135639.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"572_CR20","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1080\/00207543.2015.1035815","volume":"54","author":"GM Komaki","year":"2016","unstructured":"Komaki, G. M., Teymourian, E., & Kayvanfar, V. (2016). Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems. International Journal of Production Research, 54(4), 963\u2013983.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"572_CR21","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1016\/j.asoc.2012.04.007","volume":"13","author":"TC Wong","year":"2013","unstructured":"Wong, T. C., & Ngan, S. C. (2013). A comparison of hybrid genetic algorithm and hybrid particle swarm optimization to minimize makespan for assembly job shop. Applied Soft Computing, 13(3), 1391\u20131399.","journal-title":"Applied Soft Computing"},{"issue":"7","key":"572_CR22","first-page":"751","volume":"31","author":"K Natarajan","year":"2007","unstructured":"Natarajan, K., Mohanasundaram, K. M., Babu, B. S., Suresh, S., Raj, K. A. A. D., & Rajendran, C. (2007). Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness. The International Journal of Advanced Manufacturing Technology, 31(7), 751\u2013761.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"572_CR23","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.sbspro.2015.03.234","volume":"189","author":"M Paul","year":"2015","unstructured":"Paul, M., Sridharan, R., & Ramanan, T. R. (2015). An investigation of order review\/release policies and dispatching rules for assembly job shops with multi objective criteria. Procedia-Social and Behavioral Sciences, 189, 376\u2013384.","journal-title":"Procedia-Social and Behavioral Sciences"},{"issue":"3","key":"572_CR24","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.rcim.2007.01.001","volume":"24","author":"FTS Chan","year":"2008","unstructured":"Chan, F. T. S., Wong, T. C., & Chan, L. Y. (2008). Lot streaming for product assembly in job shop environment. Robotics and Computer-Integrated Manufacturing, 24(3), 321\u2013331.","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"issue":"3","key":"572_CR25","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.cie.2006.03.003","volume":"50","author":"ZX Guo","year":"2006","unstructured":"Guo, Z. X., Wong, W. K., Leung, S. Y. S., Fan, J. T., & Chan, S. F. (2006). Mathematical model and genetic optimization for the job shop scheduling problem in a mixed-and multi-product assembly environment: A case study based on the apparel industry. Computers & Industrial Engineering, 50(3), 202\u2013219.","journal-title":"Computers & Industrial Engineering"},{"issue":"18","key":"572_CR26","doi-asserted-by":"publisher","first-page":"4453","DOI":"10.1080\/00207540310001595864","volume":"41","author":"S Thiagarajan","year":"2003","unstructured":"Thiagarajan, S., & Rajendran, C. (2003). Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs. International Journal of Production Research, 41(18), 4453\u20134486.","journal-title":"International Journal of Production Research"},{"key":"572_CR27","doi-asserted-by":"crossref","unstructured":"Fuji, W., Jianwei, M., Di, S., Wei, L., & Xiaohong, L. (2012). Research on repair operators in the whole space search genetic algorithm of assembly job shop scheduling problem. In 2012 7th IEEE conference on industrial electronics and applications (ICIEA) (pp. 1922\u20131927).","DOI":"10.1109\/ICIEA.2012.6361043"},{"key":"572_CR28","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.cie.2015.07.018","volume":"88","author":"CJ Liao","year":"2015","unstructured":"Liao, C. J., Lee, C. H., & Lee, H. C. (2015). An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan. Computers & Industrial Engineering, 88, 317\u2013325.","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"572_CR29","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1080\/00207543.2013.848490","volume":"52","author":"H Seidgar","year":"2014","unstructured":"Seidgar, H., Kiani, M., Abedi, M., & Fazlollahtabar, H. (2014). An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem. International Journal of Production Research, 52(4), 1240\u20131256.","journal-title":"International Journal of Production Research"},{"key":"572_CR30","unstructured":"Dileeplal, J., & Narayanan, K. P. (2012). Multi-objective assembly job shop scheduling using genetic algorithm and tabu search. Doctoral dissertation, Cochin University of Science and Technology."},{"issue":"2\u20133","key":"572_CR31","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C Bierwirth","year":"1995","unstructured":"Bierwirth, C. (1995). A generalized permutation approach to job shop scheduling with genetic algorithms. Operations Research Spektrum, 17(2\u20133), 87\u201392.","journal-title":"Operations Research Spektrum"},{"key":"572_CR32","first-page":"58","volume":"15","author":"D Beasley","year":"1993","unstructured":"Beasley, D., Martin, R. R., & Bull, D. R. (1993). An overview of genetic algorithms: Part 1. Fundamentals. University Computing, 15, 58\u201358.","journal-title":"University Computing"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0572-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0572-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0572-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T19:22:37Z","timestamp":1561749757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0572-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,29]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["572"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0572-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,29]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}