{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T01:07:33Z","timestamp":1781744853230,"version":"3.54.5"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T00:00:00Z","timestamp":1441238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["51435009"],"award-info":[{"award-number":["51435009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10845-015-1144-3","type":"journal-article","created":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T04:54:14Z","timestamp":1441169654000},"page":"891-904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":70,"title":["An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time"],"prefix":"10.1007","volume":"29","author":[{"given":"W.","family":"Qin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,3]]},"reference":[{"key":"1144_CR1","doi-asserted-by":"crossref","unstructured":"Arnaout, J. P., Rabadi, G., & Musa, R. (2010). A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Journal of Intelligent Manufacturing, 21, 693\u2013701.","DOI":"10.1007\/s10845-009-0246-1"},{"key":"1144_CR2","doi-asserted-by":"publisher","unstructured":"Babu, S. A. K. I., Pratap, S., Lahoti, G., Fernandes, K. J., Tiwari, M. K., Mount, M., et al. (2014). Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling. Maritime Economics and Logistics. doi: 10.1057\/Mel.20 .","DOI":"10.1057\/Mel.20"},{"key":"1144_CR3","doi-asserted-by":"crossref","unstructured":"Baker, K. R. (1995). Lot streaming in the two-machine flow shop with set-up times. Annals of Operations Research, 57, 1\u201311.","DOI":"10.1007\/BF02099687"},{"key":"1144_CR4","doi-asserted-by":"crossref","unstructured":"Bose, S. K. (2002). An introduction to queuing systems. New York: Kluwer Academic\/Pelenum Publishers.","DOI":"10.1007\/978-1-4615-0001-8"},{"key":"1144_CR5","doi-asserted-by":"crossref","unstructured":"Chang, P. C., Hsieh, J. C., & Wang, C. Y. (2007). Adaptive multi-objective genetic algorithm for scheduling of drilling operation in printed circuit board industry. Applied Soft Computing, 7, 800\u2013806.","DOI":"10.1016\/j.asoc.2006.02.002"},{"key":"1144_CR6","unstructured":"Dorigo, M. (1992). Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italie."},{"key":"1144_CR7","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Caro, G. D., & Gambardella, L. M. (1997). Ant colony system: A cooperative learning approach to the travelling salesman problem. IEEE Transactions on Evolutionary Computation, 1, 53\u201366.","DOI":"10.1109\/4235.585892"},{"key":"1144_CR8","doi-asserted-by":"crossref","unstructured":"Dorigo, M., & Gambardella, L. M. (1997). Ant colonies for the travelling salesman problem. BioSystem, 43, 73\u201381.","DOI":"10.1016\/S0303-2647(97)01708-5"},{"key":"1144_CR9","doi-asserted-by":"crossref","unstructured":"Dr\u00f3tos, M., Erd\u0151s, G., & Kis, T. (2009). Computing lower and upper bounds for a large-scale industrial job shop scheduling problem. European Journal of Operational Research, 197, 296\u2013306.","DOI":"10.1016\/j.ejor.2008.06.004"},{"key":"1144_CR10","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"1144_CR11","doi-asserted-by":"crossref","unstructured":"Gholami, M., Zandieh, M., & Tabriz, A. (2009). Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Advanced Manufacturing Technology, 42(1\u20132), 189\u2013201.","DOI":"10.1007\/s00170-008-1577-3"},{"key":"1144_CR12","unstructured":"Gong, D. X., Ruan, X. G. (2004). A hybrid approach of GA and ACO for TSP [C] \/\/ Proceedings of the 5th world congress on intelligent control and automation. Washington, D. C., USA: IEEE, 3: 2068\u20132072."},{"key":"1144_CR13","doi-asserted-by":"crossref","unstructured":"Gunther, H. O., Gronalt, M., & Zeller, R. (1998). Job sequencing and component set-up on a surface mount placement machine. Production Planning & Control, 9, 201\u2013211.","DOI":"10.1080\/095372898234424"},{"key":"1144_CR14","doi-asserted-by":"crossref","unstructured":"Hall, N. G., Laporte, G., Selvarajah, E., & Sriskandarajah, C. (2003). Scheduling and lot streaming in flow shops with no-wait in process. Journal of Scheduling, 6, 339\u2013354.","DOI":"10.1023\/A:1024042209719"},{"key":"1144_CR15","doi-asserted-by":"crossref","unstructured":"Huang, R. H. (2010). Multi-objective job-shop scheduling with lot-splitting production. International Journal of Production Economics, 124, 206\u2013213.","DOI":"10.1016\/j.ijpe.2009.10.026"},{"key":"1144_CR16","unstructured":"Huang, M., Liu, P. F., & Liang, X. (2009). Ant colony algorithm oriented to Job Shop scheduling problem based on self-adaptive and uneven windows. Computer Integrated Manufacturing Systems, 15(10), 1973\u20131978."},{"key":"1144_CR17","doi-asserted-by":"crossref","unstructured":"Ji, P., Sze, M. T., & Lee, W. B. (2001). A genetic algorithm of determining cycle time for printed circuit board assembly lines. European Journal of Operational Research, 128, 175\u2013184.","DOI":"10.1016\/S0377-2217(99)00348-3"},{"key":"1144_CR18","doi-asserted-by":"crossref","unstructured":"Kaczmarczyk, W., Sawik, T., Schaller, A., & Tirpaks, T. (2004). Optimal versus heuristic scheduling of surface mount technology lines. International Journal of Production Research, 42, 2083\u20132110.","DOI":"10.1080\/002075403010001647604"},{"key":"1144_CR19","doi-asserted-by":"crossref","unstructured":"Kis, T., & Pesch, E. (2005). A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. European Journal of Operational Research, 164, 592\u2013608.","DOI":"10.1016\/j.ejor.2003.12.026"},{"key":"1144_CR20","doi-asserted-by":"crossref","unstructured":"Lamothe, J., Marmier, F., Dupuy, M., Gaborit, P., & Dupont, L. (2012). Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints. Computer & Operation Research, 39, 1236\u20131244.","DOI":"10.1016\/j.cor.2010.07.007"},{"key":"1144_CR21","doi-asserted-by":"crossref","unstructured":"Linn, R., & Zhang, W. (1999). Hybrid flow shop scheduling: A survey. Computers & Industrial Engineering, 37(1\u20132), 57\u201361.","DOI":"10.1016\/S0360-8352(99)00023-6"},{"key":"1144_CR22","unstructured":"Liu, G. B. (2012). Research on production scheduling methods of complex unrelated parallel machines. Shanghai: Shanghai Jiao Tong University."},{"key":"1144_CR23","doi-asserted-by":"crossref","unstructured":"Liu, S. C. (2003). A heuristic method for discrete lot streaming with variable sub-lots in a flow shop. International Journal of Advanced Manufacturing Technology, 22, 662\u2013668.","DOI":"10.1007\/s00170-002-1516-7"},{"key":"1144_CR24","doi-asserted-by":"crossref","unstructured":"Marimuthu, S., Ponnambalam, S. G., & Jawahar, N. (2007). Tabu search and simulated annealing algorithms for scheduling in flow shops with lot streaming. Proceedings of the Institution of Mechanical Engineers Vol. 221 Part B: Journal of Engineer Manufacture, 317\u2013331.","DOI":"10.1243\/09544054JEM334"},{"key":"1144_CR25","doi-asserted-by":"crossref","unstructured":"Mehta, S. V., & Uzsoy, R. (1999). Predictable scheduling of a single machine subject to breakdowns. International Journal of Computer Integrated Manufacturing, 12(1), 15\u201338.","DOI":"10.1080\/095119299130443"},{"key":"1144_CR26","doi-asserted-by":"crossref","unstructured":"Potts, C. N., & Baker, K. R. (1989). Flow shop scheduling with lot streaming. Operations Research Letters, 8, 297\u2013303.","DOI":"10.1016\/0167-6377(89)90013-8"},{"key":"1144_CR27","doi-asserted-by":"crossref","unstructured":"Quadt, D., & Kuhn, H. (2005). Conceptual framework for lot-sizing and scheduling of flexible flow lines. Interational Journal of Production Research, 43, 2291\u20132308.","DOI":"10.1080\/00207540500066762"},{"key":"1144_CR28","unstructured":"Ruiz, R. (2010). Lot-streaming for sequence dependent setup time flowshop problems. In Proceedings of 4th international conference on industrial engineering and industrial management. Donostia, Spain."},{"key":"1144_CR29","doi-asserted-by":"crossref","unstructured":"Salvador, M. S. (1973). A solution to a special class of flow shop scheduling problems. In S. E. Elmaghraby (Ed.), Symposium on the theory of scheduling and its applications (pp. 83\u201391). Berlin: Springer.","DOI":"10.1007\/978-3-642-80784-8_7"},{"key":"1144_CR30","doi-asserted-by":"crossref","unstructured":"Sawik, T. (2001). Mixed integer programming for scheduling surface mount technology lines. International Journal of Production Research, 39, 3219\u20133235.","DOI":"10.1080\/00207540110053561"},{"key":"1144_CR31","doi-asserted-by":"crossref","unstructured":"Truscott, W. (1986). Production scheduling with capacity constrained transportation activities. Journal of Operation Management, 6, 333\u2013348.","DOI":"10.1016\/0272-6963(86)90008-2"},{"key":"1144_CR32","doi-asserted-by":"crossref","unstructured":"Wang, H. M., Chou, F. D., & Wu, F. C. (2011). A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan. International Journal of Advanced Manufacturing Technology, 53, 761\u2013776.","DOI":"10.1007\/s00170-010-2868-z"},{"key":"1144_CR33","unstructured":"Wu, K. (2007). Study on manufacturing execution process monitoring and control for multi type and volume production. Beijing: Beijing Institute of Technology."},{"key":"1144_CR34","unstructured":"Xiao, Y., & Li, B. (2003). Ant colony algorithm based on little window. Computer Engineering, 20, 056."},{"key":"1144_CR35","unstructured":"Xu, Z., & Gu, X. (2005). Immune scheduling algorithm for flow shop problems under uncertainty. XITONG GONGCHENG XUEBAO, 20(4), 374."},{"key":"1144_CR36","doi-asserted-by":"crossref","unstructured":"Yang, J. (2015). Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage. Computers & Operations Research, 58, 1\u20138.","DOI":"10.1016\/j.cor.2014.11.012"},{"key":"1144_CR37","unstructured":"Zhang, Y., Rong, Z. J., M J. (2014). Hybrid flow shop problem with batching machines and multi-jobs families. Computer Integrated Manufacturing Systems, 20(2): 407\u2013413."},{"key":"1144_CR38","unstructured":"Zhao, H., Tang, L., & Zhang, Y. (2008). Simulation and analysis on dynamic job shop scheduling toward networked manufacturing. Journal of System Simulation, 11, 057."}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1144-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-015-1144-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1144-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1144-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T22:51:21Z","timestamp":1567119081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-015-1144-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,3]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["1144"],"URL":"https:\/\/doi.org\/10.1007\/s10845-015-1144-3","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,3]]}}}