{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:17:33Z","timestamp":1758122253010},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319018560"},{"type":"electronic","value":"9783319018577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-01857-7_52","type":"book-chapter","created":{"date-parts":[[2013,8,7]],"date-time":"2013-08-07T03:47:00Z","timestamp":1375847220000},"page":"531-541","source":"Crossref","is-referenced-by-count":3,"title":["Heuristic Solution Algorithm for Routing Flow Shop with Buffers and Ready Times"],"prefix":"10.1007","author":[{"given":"Jerzy","family":"J\u00f3zefczyk","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Markowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","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., Kovalyov, M.Y.: 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":"52_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/opre.47.1.165","volume":"47","author":"I. Averbakh","year":"1999","unstructured":"Averbakh, I., Berman, O.: A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems. Operations Research\u00a047, 165\u2013170 (1999)","journal-title":"Operations Research"},{"key":"52_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2003.06.050","volume":"166","author":"I. Averbakh","year":"2005","unstructured":"Averbakh, I., Berman, O., Chernykh, I.: A 6\/5 -approximation algorithm for the two-machine routing open-shop problem on a two-node network. European Journal of Operational Research\u00a0166, 3\u2013244 (2005)","journal-title":"European Journal of Operational Research"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(99)00415-4","volume":"130","author":"J. Cheng","year":"2001","unstructured":"Cheng, J., Steiner, G., Stephenson, P.: A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. European Journal of Operational Research\u00a0130, 559\u2013575 (2001)","journal-title":"European Journal of Operational Research"},{"key":"52_CR5","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report, GSIA, Carnegie-Mellon University, Pittsburgh, PA (1976)"},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"J.M. Framinan","year":"2004","unstructured":"Framinan, J.M., Gupta, J.N.D., Leisten, R.: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society\u00a055, 1243\u20131255 (2004)","journal-title":"Journal of the Operational Research Society"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"169","author":"J.N.D. Gupta","year":"2006","unstructured":"Gupta, J.N.D., Stafford, E.F.: Flowshop scheduling research after five decades. European Journal of Operational Research\u00a0169, 699\u2013711 (2006)","journal-title":"European Journal of Operational Research"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly\u00a01, 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"52_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1007\/978-3-540-69731-2_99","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2008","author":"J. J\u00f3zefczyk","year":"2008","unstructured":"J\u00f3zefczyk, J., Markowski, M.: Heuristic Algorithms for Solving Uncertain Routing-Scheduling Problem. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2008. LNCS (LNAI), vol.\u00a05097, pp. 1052\u20131063. Springer, Heidelberg (2008)"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"J\u00f3zefczyk, J., Markowski, M.: Simulated annealing based robust algorithm for routing-scheduling problem with uncertain execution times. Information Control Problems in Manufacturing\u00a013 (2009)","DOI":"10.3182\/20090603-3-RU-2001.0125"},{"key":"52_CR11","unstructured":"J\u00f3zefczyk, J., Markowski, M.: Integrated Optimization Problems in Operations Research. In: Proceedings of 23rd Int. Conf. on Systems Research, Informatics and Cybernetics, Analysis and Decision Making for Complex and Uncertain Systems, Baden-Baden, Germany, vol.\u00a01, pp. 39\u201343 (2011)"},{"key":"52_CR12","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C.N. Potts","year":"2000","unstructured":"Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. European Journal of Operational Research\u00a0120, 228\u2013249 (2000)","journal-title":"European Journal of Operational Research"},{"key":"52_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0377-2217(02)00485-X","volume":"149","author":"C.H. Rajendran","year":"2003","unstructured":"Rajendran, C.H., Ziegler, H.: Scheduling to minimize the sum of weighted flow time and weighted tardiness of jobs in a flowshop with sequence -dependent setup times. European Journal of Operational Research\u00a0149, 513\u2013522 (2003)","journal-title":"European Journal of Operational Research"},{"key":"52_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.cie.2005.01.019","volume":"48","author":"D. Rebaine","year":"2005","unstructured":"Rebaine, D.: Flow shop vs. permutation shop with time delays. Computers & Industrial Engineering\u00a048, 357\u2013362 (2005)","journal-title":"Computers & Industrial Engineering"},{"key":"52_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00170-006-0726-9","volume":"35","author":"R. Ruiz","year":"2007","unstructured":"Ruiz, R., Allahverdi, A.: No-wait flowshop with separate setup times to minimize maximum lateness. International Journal of Advanced Manufacturing Technology\u00a035, 551\u2013565 (2007)","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"52_CR16","unstructured":"Ruiz, R., Stutzle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. IRIDIA, Technical report number TR\/IRIDIA\/2006-02 (2006)"},{"key":"52_CR17","unstructured":"Syslo, M.M., Deo, N., Kowalik, J.S.: Algorithms of discrete optimization. In: PWN, p. 299 (1999) (in Polish)"},{"key":"52_CR18","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ejor.2011.02.028","volume":"213","author":"W. Yu","year":"2011","unstructured":"Yu, W., Liu, Z., Wang, L., Fan, T.: Routing open shop and flow shop scheduling problems. European Journal of Operational Research\u00a0213, 24\u201336 (2011)","journal-title":"European Journal of Operational Research"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Systems Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-01857-7_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T08:57:31Z","timestamp":1557997051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-01857-7_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319018560","9783319018577"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01857-7_52","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}