{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T17:52:16Z","timestamp":1765993936778},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,11,11]],"date-time":"2010-11-11T00:00:00Z","timestamp":1289433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10951-010-0205-x","type":"journal-article","created":{"date-parts":[[2010,11,9]],"date-time":"2010-11-09T23:40:55Z","timestamp":1289346055000},"page":"483-500","source":"Crossref","is-referenced-by-count":19,"title":["A water-flow algorithm for flexible flow shop scheduling with\u00a0intermediate buffers"],"prefix":"10.1007","volume":"14","author":[{"given":"Trung Hieu","family":"Tran","sequence":"first","affiliation":[]},{"given":"Kien Ming","family":"Ng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,11]]},"reference":[{"issue":"4","key":"205_CR1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0305-0548(97)00073-7","volume":"25","author":"M. S. Akturk","year":"1998","unstructured":"Akturk, M. S., & Yildirim, M. B. (1998). A new lower bounding scheme for the total weighted tardiness problem. Computers and Operations Research, 25(4), 265\u2013278.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"205_CR2","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(00)00142-9","volume":"132","author":"M. Azizoglu","year":"2001","unstructured":"Azizoglu, M., Cakmak, E., & Kondakci, S. (2001). A flexible flow shop problem with total flow time minimization. European Journal of Operational Research, 132(3), 528\u2013538.","journal-title":"European Journal of Operational Research"},{"key":"205_CR3","volume-title":"The nature of the environment","author":"A. Goudie","year":"1993","unstructured":"Goudie, A. (1993). The nature of the environment. Oxford: Blackwell Sci."},{"issue":"3","key":"205_CR4","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J. Grabowski","year":"2000","unstructured":"Grabowski, J., & Pempera, J. (2000). Sequencing of jobs in some production system. European Journal of Operational Research, 125(3), 535\u2013550.","journal-title":"European Journal of Operational Research"},{"key":"205_CR5","volume-title":"Erosion and environment","author":"M. Holy","year":"1982","unstructured":"Holy, M. (1982). Erosion and environment. Elmsford: Pergamon."},{"key":"205_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/9781444314748","volume-title":"Glucose syrups: Technology and applications","author":"P. Hull","year":"2010","unstructured":"Hull, P. (2010). Glucose syrups: Technology and applications. New York: Wiley\u2013Blackwell."},{"issue":"1","key":"205_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0031-3203(01)00027-9","volume":"35","author":"I. K. Kim","year":"2002","unstructured":"Kim, I. K., Jung, D. W., & Park, R. H. (2002). Document image binarization based on topographic analysis using a water flow model. Pattern Recognition, 35(1), 265\u2013277.","journal-title":"Pattern Recognition"},{"issue":"6","key":"205_CR8","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"S. T. McCormick","year":"1989","unstructured":"McCormick, S. T., Pinedo, M. L., Shenker, S., & Wolf, B. (1989). Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37(6), 925\u2013936.","journal-title":"Operations Research"},{"issue":"12","key":"205_CR9","doi-asserted-by":"crossref","first-page":"2612","DOI":"10.1016\/j.patcog.2004.11.025","volume":"38","author":"H. H. Oh","year":"2005","unstructured":"Oh, H. H., Lim, K. T., & Chien, S. I. (2005). An improved binarization algorithm based on a water flow model for document image with inhomogeneous backgrounds. Pattern Recognition, 38(12), 2612\u20132625.","journal-title":"Pattern Recognition"},{"key":"205_CR10","unstructured":"Pedersen, S., & Vang-Hendriksen, H. (2001). Method for production of maltose and\/or enzymatically modified starch. World Intellectual Property Organization, International Publication Number: WO\u00a001\/16349 A1."},{"key":"205_CR11","volume-title":"Planning and scheduling in manufacturing and services","author":"M. Pinedo","year":"2005","unstructured":"Pinedo, M. (2005). Planning and scheduling in manufacturing and services. New York: Springer."},{"issue":"3","key":"205_CR12","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1016\/j.ejor.2006.01.042","volume":"178","author":"D. Quadt","year":"2007","unstructured":"Quadt, D., & Kuhn, H. (2007). A taxonomy of flexible flow line scheduling procedures. European Journal of Operational Research, 178(3), 686\u2013698.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"205_CR13","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I. Ribas","year":"2010","unstructured":"Ribas, I., Leisten, R., & Framinan, J. M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers and Operations Research, 37(8), 1439\u20131454.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"205_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R. Ruiz","year":"2010","unstructured":"Ruiz, R., & Vazquez-Rodriguez, J. A. (2010). The hybrid flow shop scheduling problem. European Journal of Operational Research, 205(1), 1\u201318.","journal-title":"European Journal of Operational Research"},{"issue":"13","key":"205_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0895-7177(00)00110-2","volume":"31","author":"T. Sawik","year":"2000","unstructured":"Sawik, T. (2000). Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Mathematical and Computer Modeling, 31(13), 39\u201352.","journal-title":"Mathematical and Computer Modeling"},{"issue":"14","key":"205_CR16","doi-asserted-by":"crossref","first-page":"3219","DOI":"10.1080\/00207540110053561","volume":"39","author":"T. Sawik","year":"2001","unstructured":"Sawik, T. (2001). Mixed integer programming for scheduling surface mount technology lines. International Journal of Production Research, 39(14), 3219\u20133235.","journal-title":"International Journal of Production Research"},{"key":"205_CR17","doi-asserted-by":"crossref","first-page":"3226","DOI":"10.1109\/CEC.2007.4424885","volume":"2007","author":"H. Shah-Hosseini","year":"2007","unstructured":"Shah-Hosseini, H. (2007). Problem solving by intelligent water drops. Proceedings IEEE Congress on Evolutionary Computation CEC, 2007, 3226\u20133231.","journal-title":"Proceedings IEEE Congress on Evolutionary Computation CEC"},{"issue":"2","key":"205_CR18","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1108\/17563780810874717","volume":"1","author":"H. Shah-Hosseini","year":"2008","unstructured":"Shah-Hosseini, H. (2008). Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem. International Journal of Intelligent Computing and Cybernetics, 1(2), 193\u2013212.","journal-title":"International Journal of Intelligent Computing and Cybernetics"},{"issue":"1\u20132","key":"205_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1504\/IJBIC.2009.022775","volume":"1","author":"H. Shah-Hosseini","year":"2009","unstructured":"Shah-Hosseini, H. (2009). The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm. International Journal of Bio-Inspired Computation, 1(1\u20132), 71\u201379.","journal-title":"International Journal of Bio-Inspired Computation"},{"issue":"1","key":"205_CR20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/09537289008919291","volume":"1","author":"H. D. Sherali","year":"1990","unstructured":"Sherali, H. D., Sarin, S. C., & Kodialam, M. S. (1990). Models and algorithms for a two-stage production process. Production Planning and Control, 1(1), 27\u201339.","journal-title":"Production Planning and Control"},{"issue":"3","key":"205_CR21","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1057\/palgrave.jors.2602033","volume":"57","author":"L. X. Tang","year":"2006","unstructured":"Tang, L. X., & Xuan, H. (2006). Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers. Journal of the Operational Research Society, 57(3), 316\u2013324.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"205_CR22","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.cor.2007.10.011","volume":"36","author":"R. Tavakkoli-Moghaddam","year":"2009","unstructured":"Tavakkoli-Moghaddam, R., Safaei, N., & Sassani, F. (2009). A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Computers and Operations Research, 36(2), 402\u2013414.","journal-title":"Computers and Operations Research"},{"key":"205_CR23","unstructured":"Wardono, B. (2001). Algorithms for the multi-stage parallel machine problem with buffer constraints. Ph.D. dissertation, North Carolina State University."},{"issue":"2","key":"205_CR24","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/S0377-2217(02)00873-1","volume":"155","author":"B. Wardono","year":"2004","unstructured":"Wardono, B., & Fathi, Y. (2004). A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. European Journal of Operational Research, 155(2), 380\u2013401.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"205_CR25","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/opre.36.3.445","volume":"36","author":"R. J. Wittrock","year":"1988","unstructured":"Wittrock, R. J. (1988). An adaptable scheduling algorithm for flexible flow lines. Operations Research, 36(3), 445\u2013453.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0205-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0205-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0205-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:45Z","timestamp":1559468385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0205-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,11]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["205"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0205-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,11]]}}}