{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:02:26Z","timestamp":1743030146697,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642259432"},{"type":"electronic","value":"9783642259449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25944-9_12","type":"book-chapter","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T01:15:12Z","timestamp":1325553312000},"page":"91-97","source":"Crossref","is-referenced-by-count":2,"title":["Minimizing the Total Flowtime Flowshop with Blocking Using a Discrete Artificial Bee Colony"],"prefix":"10.1007","author":[{"given":"Yu-Yan","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-Hua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Jie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bao","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R. Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential Evolution\u2014A Simple and Efficient Adaptive Scheme for Global Optimization Over Continuous Spaces. Journal of Global Optimization\u00a011, 341\u2013359 (1997)","journal-title":"Journal of Global Optimization"},{"key":"12_CR2","doi-asserted-by":"publisher","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., et al.: A Survey of Scheduling Problems with Setup Times or Costs. European Journal of Operational Research\u00a0187, 985\u20131032 (2008)","journal-title":"European Journal of Operational Research"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"S.T. McCormich","year":"1989","unstructured":"McCormich, S.T., Pinedo, M.L., Shenker, S., Wolf, B.: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Operations Research\u00a037, 925\u2013936 (1989)","journal-title":"Operations Research"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.omega.2008.05.002","volume":"37","author":"D.. C. Laha","year":"2009","unstructured":"Laha, D. C., Subhash, S.: A Heuristic to Minimize Total Flowtime in Permutation Flowshop. Omega\u00a037, 734\u2013739 (2009)","journal-title":"Omega"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1080\/00207549008942855","volume":"28","author":"R. Leisten","year":"1990","unstructured":"Leisten, R.: Flowshop Sequencing Problems with Limited Buffer Storage. International Journal of Production Research\u00a028, 2085\u20132100 (1990)","journal-title":"International Journal of Production Research"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0925-5273(03)00065-3","volume":"87","author":"D.P. Ronconi","year":"2004","unstructured":"Ronconi, D.P.: A Note on Constructive Heuristics for the Flowshop Problem with Blocking. International Journal of Production Economics\u00a087, 39\u201348 (2004)","journal-title":"International Journal of Production Economics"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","volume":"139","author":"F. Croce","year":"2002","unstructured":"Croce, F., Della, G.M., Tadei, R.: An Improved Branch-and-bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem. European Journal of Operational Research\u00a0139, 293\u2013301 (2002)","journal-title":"European Journal of Operational Research"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/S0925-5273(99)00104-8","volume":"70","author":"V. Caraffa","year":"2001","unstructured":"Caraffa, V., Ianes, S., Bagchi, T., Sriskandarajah, C.: Minimizing Makespan in a Blocking Flowshop Using Genetic Algorithms. International Journal of Production Economics\u00a070, 102\u2013115 (2001)","journal-title":"International Journal of Production Economics"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","volume":"55","author":"Q.K. Pan","year":"2008","unstructured":"Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A Discrete Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem. Computers and Industrial Engineering\u00a055, 795\u2013816 (2008)","journal-title":"Computers and Industrial Engineering"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Wang, L., Pan, Q.K., Tasgetiren, M.F.: Minimizing the Total Flow Time in a Flow Shop with Blocking by Using Hybrid Harmony Search Algorithms. Expert Systems with Applications (submitted for publication, 2010)","DOI":"10.1016\/j.eswa.2010.04.042"},{"key":"12_CR11","unstructured":"Karaboga, D.: An Idea Based on Honey Bee Swarm for Numerical Optimization, Technical Report TR06. Computer Engineering Department. Erciyes University,Turkey (2005)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Pan, Q.K., Tasgetiren, M.F., Suganthan, P.N., Chua, T.J.: A Discrete Artificial Bee Colony Algorithm for the Lot-streaming Flow Shop Scheduling Problem. Infromation Sciences (2010)","DOI":"10.1109\/CEC.2010.5586300"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R. Ruiz","year":"2008","unstructured":"Ruiz, R., Thomas, S.: An Iterated Greedy Heuristic for the Sequence Dependent Setup Times Flowshop Problem with Makespan and Weighted Tardiness Objectives. European Journal of Operational Research\u00a0187, 1143\u20131159 (2008)","journal-title":"European Journal of Operational Research"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for Basic Scheduling Problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"12_CR15","first-page":"91","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E.E.J., Ham, I.: A Heuristic Algorithm for Them-machine, n-job Flow Shop Sequencing Problem. International Journal of Management Science\u00a011, 91\u201395 (1983)","journal-title":"International Journal of Management Science"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25944-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T17:28:37Z","timestamp":1556040517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25944-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259432","9783642259449"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25944-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}