{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T16:10:54Z","timestamp":1717949454310},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T00:00:00Z","timestamp":1434672000000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s00521-015-1963-3","type":"journal-article","created":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T07:10:55Z","timestamp":1434611455000},"page":"1657-1667","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Research on group search optimizers for a reconfigurable flow shop sequencing problem"],"prefix":"10.1007","volume":"27","author":[{"given":"Hadi","family":"Mokhtari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,19]]},"reference":[{"key":"1963_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ijpe.2004.04.002","volume":"96","author":"MA Al-Fawzan","year":"2005","unstructured":"Al-Fawzan MA, Haouari M (2005) A bi-objective model for robust resource-constrained project scheduling. Int J Prod Econ 96:175\u2013187","journal-title":"Int J Prod Econ"},{"key":"1963_CR2","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1016\/S0305-0548(02)00114-4","volume":"30","author":"RL Bulfin","year":"2003","unstructured":"Bulfin RL, Hallah M (2003) Minimizing the weighted number of tardy jobs on a two-machine flow shop. Comput Oper Res 30:1887\u20131900","journal-title":"Comput Oper Res"},{"key":"1963_CR3","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/j.ejor.2006.07.005","volume":"181","author":"B-C Choi","year":"2007","unstructured":"Choi B-C, Yoon S-H, Chung S-J (2007) Single machine scheduling problem with controllable processing times and resource dependent release times. Euro J Oper Res 181:645\u2013653","journal-title":"Euro J Oper Res"},{"key":"1963_CR4","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1016\/S0305-0548(02)00066-7","volume":"30","author":"CC Daniel Ng","year":"2003","unstructured":"Daniel Ng CC, Edwin Cheng TC, Kovalyov MY, Lam SS (2003) Single machine scheduling with a variable common due date and resource-dependent processing times. Comput Oper Res 30:1173\u20131185","journal-title":"Comput Oper Res"},{"key":"1963_CR5","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1016\/j.cor.2004.02.009","volume":"32","author":"J Grabowski","year":"2005","unstructured":"Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow-shop problem with makespan criterion. Comput Oper Res 32:2197\u20132212","journal-title":"Comput Oper Res"},{"key":"1963_CR6","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"169","author":"JND Gupta","year":"2006","unstructured":"Gupta JND, Stafford EF (2006) Flow shop scheduling research after five decades. Euro J Oper Res 169:699\u2013711","journal-title":"Euro J Oper Res"},{"issue":"14","key":"1963_CR7","doi-asserted-by":"crossref","first-page":"4217","DOI":"10.1080\/00207540802404364","volume":"48","author":"AN Haq","year":"2010","unstructured":"Haq AN, Ramanan TR, Shashikant KS, Sridharan R (2010) A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling. Int J Prod Res 48(14):4217\u20134231","journal-title":"Int J Prod Res"},{"issue":"4","key":"1963_CR8","first-page":"809","volume":"33","author":"G He","year":"2012","unstructured":"He G, Cui Z, Tan Y (2012) Interactive dynamic neighborhood differential evolutionary group search optimizer. J Chin Comput Syst 33(4):809\u2013814","journal-title":"J Chin Comput Syst"},{"key":"1963_CR9","first-page":"527","volume":"16","author":"S He","year":"2010","unstructured":"He S (2010) Training artificial neural networks using Levy group search optimizer. J Multi-Valued Log Soft Comput 16:527\u2013546","journal-title":"J Multi-Valued Log Soft Comput"},{"issue":"5","key":"1963_CR10","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1109\/TEVC.2009.2011992","volume":"13","author":"S He","year":"2009","unstructured":"He S, Wu QH, Saunders JR (2009) Group search optimizer: an optimization algorithm inspired by animal searching behavior. IEEE Trans Evol Comput 13(5):973\u2013990","journal-title":"IEEE Trans Evol Comput"},{"issue":"14","key":"1963_CR11","doi-asserted-by":"crossref","first-page":"3737","DOI":"10.1080\/00207540600665893","volume":"46","author":"J-Y Huang","year":"2008","unstructured":"Huang J-Y, Yao M-J (2008) A genetic algorithm for solving the economic lot scheduling problem in flow shops. Int J Prod Res 46(14):3737\u20133761","journal-title":"Int J Prod Res"},{"key":"1963_CR12","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/0005-1098(86)90014-2","volume":"22","author":"A Janiak","year":"1985","unstructured":"Janiak A (1985) Time-optimal control in a single machine problem with resource constraints. Automatica 22:745\u2013747","journal-title":"Automatica"},{"key":"1963_CR13","first-page":"289","volume":"23","author":"A Janiak","year":"1987","unstructured":"Janiak A (1987) One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika 23:289\u2013293","journal-title":"Kybernetika"},{"key":"1963_CR14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","volume":"94","author":"A Janiak","year":"1996","unstructured":"Janiak A, Kovalyov MY (1996) Single machine scheduling subjective to deadlines and resource dependent processing times. Eur J Oper Res 94:284\u2013291","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1963_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Quart 1(1):61\u201368","journal-title":"Nav Res Logist Quart"},{"key":"1963_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1010918518726","volume":"102","author":"CY Lee","year":"2001","unstructured":"Lee CY, Lei L (2001) Multiple-project scheduling with controllable project duration and hard resource constraint: some solvable cases. Ann Oper Res 102:287\u2013307","journal-title":"Ann Oper Res"},{"issue":"8","key":"1963_CR17","doi-asserted-by":"crossref","first-page":"5551","DOI":"10.1016\/j.asoc.2011.05.005","volume":"11","author":"K Li","year":"2011","unstructured":"Li K, Shi Y, Yang SL, Cheng BY (2011) Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl Soft Comput 11(8):5551\u20135557","journal-title":"Appl Soft Comput"},{"issue":"5","key":"1963_CR18","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1007\/s00521-014-1778-7","volume":"26","author":"H Mokhtari","year":"2015","unstructured":"Mokhtari H (2015) Designing an efficient bi-criteria iterated greedy heuristic for simultaneous order scheduling and resource allocation: a balance between cost and lateness measures. Neural Comput Appl 26(5):1085\u20131101","journal-title":"Neural Comput Appl"},{"issue":"19","key":"1963_CR19","doi-asserted-by":"crossref","first-page":"5851","DOI":"10.1080\/00207543.2010.523724","volume":"49","author":"H Mokhtari","year":"2011","unstructured":"Mokhtari H, Abadi INK, Cheraghalikhani A (2011) A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makes pan and cost of resources. Int J Prod Res 49(19):5851\u20135875","journal-title":"Int J Prod Res"},{"key":"1963_CR20","doi-asserted-by":"crossref","first-page":"12630","DOI":"10.1016\/j.eswa.2011.04.051","volume":"38","author":"H Mokhtari","year":"2011","unstructured":"Mokhtari H, Abadi INK, Zegordi SH (2011) Production capacity planning and scheduling in a no-wait environment with controllable processing times: an integrated modeling approach. Expert Syst Appl 38:12630\u201312642","journal-title":"Expert Syst Appl"},{"key":"1963_CR21","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"26","author":"E Nowicki","year":"1990","unstructured":"Nowicki E, Zdrzalka S (1990) A survey of results for sequencing problems with controllable processing times. Discrete Appl Math 26:271\u2013287","journal-title":"Discrete Appl Math"},{"key":"1963_CR22","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/S0305-0548(00)00090-3","volume":"29","author":"JCH Pan","year":"2002","unstructured":"Pan JCH, Chen JS, Chao CM (2002) Minimizing tardiness in a two-machine flow-shop. Comput Oper Res 29:869\u2013885","journal-title":"Comput Oper Res"},{"key":"1963_CR23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.cor.2007.08.007","volume":"36","author":"B Qian","year":"2009","unstructured":"Qian B, Wang L, Huang DX, Wang WL, Wang X (2009) An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Comput Oper Res 36:209\u2013233","journal-title":"Comput Oper Res"},{"key":"1963_CR24","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10878-006-9015-7","volume":"13","author":"AR Rahimi-Vahed","year":"2007","unstructured":"Rahimi-Vahed AR, Mirghorbani SM (2007) A multi-objective particle swarm for a flow shop scheduling problem. J Comb Optim 13:79\u2013102","journal-title":"J Comb Optim"},{"key":"1963_CR25","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1007\/s00170-003-1926-1","volume":"25","author":"D Ravindran","year":"2005","unstructured":"Ravindran D, Noorul Haq A, Selvakuar SJ, Sivaraman R (2005) Flow shop scheduling with multiple objective of minimizing makespan and total flow time. Int J Adv Manuf Technol 25:1007\u20131012","journal-title":"Int J Adv Manuf Technol"},{"key":"1963_CR26","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1287\/msom.1060.0139","volume":"9","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manuf Serv Oper Manag 9:332\u2013350","journal-title":"Manuf Serv Oper Manag"},{"key":"1963_CR27","doi-asserted-by":"crossref","first-page":"5072","DOI":"10.1016\/j.ins.2007.06.001","volume":"177","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam R, Rahimi-Vahed A, Mirzaei AH (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf Sci 177:5072\u20135090","journal-title":"Inf Sci"},{"key":"1963_CR28","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/S0377-2217(02)00524-6","volume":"152","author":"HW Thornton","year":"2004","unstructured":"Thornton HW, Hunsucker JL (2004) A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. Euro J Oper Res 152:96\u2013114","journal-title":"Euro J Oper Res"},{"issue":"17","key":"1963_CR29","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1080\/00207540701294627","volume":"46","author":"C-T Tseng","year":"2008","unstructured":"Tseng C-T, Liao C-J (2008) A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Int J Prod Res 46(17):4655\u20134670","journal-title":"Int J Prod Res"},{"key":"1963_CR30","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.amc.2005.11.162","volume":"180","author":"J Wang","year":"2006","unstructured":"Wang J, Ng C, Cheng T, Liu L (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180:185\u2013193","journal-title":"Appl Math Comput"},{"key":"1963_CR31","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1504\/IJCSM.2013.054682","volume":"4","author":"C Wei","year":"2013","unstructured":"Wei C, Fang J (2013) Group search optimiser: a brief survey. Int J Comput Sci Math 4:42\u201350","journal-title":"Int J Comput Sci Math"},{"key":"1963_CR32","doi-asserted-by":"crossref","first-page":"2997","DOI":"10.1016\/j.ins.2009.04.009","volume":"179","author":"J Xu","year":"2009","unstructured":"Xu J, Zhou X (2009) A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem. Inf Sci 179:2997\u20133017","journal-title":"Inf Sci"},{"issue":"19","key":"1963_CR33","doi-asserted-by":"crossref","first-page":"4015","DOI":"10.1080\/00207540410001699381","volume":"42","author":"T Yang","year":"2004","unstructured":"Yang T, Kuo Y, Chang I (2004) Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors\u2014a case study. Int J Prod Res 42(19):4015\u20134030","journal-title":"Int J Prod Res"},{"key":"1963_CR34","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1504\/IJWMC.2011.044102","volume":"5","author":"J Yao","year":"2011","unstructured":"Yao J, Cui ZH, Wei ZH, Tan Y (2011) Hybrid group search optimiser with quadratic interpolation method and its application. Int J Wirel Mob Comput 5:98\u2013106","journal-title":"Int J Wirel Mob Comput"},{"issue":"24","key":"1963_CR35","doi-asserted-by":"crossref","first-page":"6999","DOI":"10.1080\/00207540802400636","volume":"47","author":"M Zandieh","year":"2009","unstructured":"Zandieh M, Gholami M (2009) An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int J Prod Res 47(24):6999\u20137027","journal-title":"Int J Prod Res"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-1963-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-015-1963-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-1963-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T15:34:12Z","timestamp":1717947252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-015-1963-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,19]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["1963"],"URL":"https:\/\/doi.org\/10.1007\/s00521-015-1963-3","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,19]]}}}