{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T13:43:49Z","timestamp":1778679829195,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T00:00:00Z","timestamp":1187827200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,9,13]]},"DOI":"10.1007\/s10479-007-0227-8","type":"journal-article","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T19:01:26Z","timestamp":1187809286000},"page":"143-171","source":"Crossref","is-referenced-by-count":34,"title":["Some effective heuristics for no-wait flowshops with setup times to minimize total completion time"],"prefix":"10.1007","volume":"156","author":[{"given":"Rub\u00e9n","family":"Ruiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Allahverdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,23]]},"reference":[{"issue":"6","key":"227_CR1","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(99)00136-7","volume":"28","author":"T. Aldowaisan","year":"2001","unstructured":"Aldowaisan, T. (2001). A new heuristic and dominance relations for no-wait flowshops with setups. Computers & Operations Research, 28(6), 563\u2013584.","journal-title":"Computers & Operations Research"},{"issue":"9","key":"227_CR2","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/S0305-0548(98)00002-1","volume":"25","author":"T. Aldowaisan","year":"1998","unstructured":"Aldowaisan, T., & Allahverdi, A. (1998). Total flowtime in no-wait flowshops with separated setup times. Computers & Operations Research, 25(9), 757\u2013765.","journal-title":"Computers & Operations Research"},{"issue":"8","key":"227_CR3","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1016\/S0305-0548(02)00068-0","volume":"30","author":"T. Aldowaisan","year":"2003","unstructured":"Aldowaisan, T., & Allahverdi, A. (2003). New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research, 30(8), 1219\u20131231.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"227_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0305-0548(99)00010-6","volume":"27","author":"A. Allahverdi","year":"2000","unstructured":"Allahverdi, A. (2000). Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times. Computers & Operations Research, 27(2), 111\u2013127.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"227_CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1111\/j.1475-3995.2000.tb00197.x","volume":"7","author":"A. Allahverdi","year":"2000","unstructured":"Allahverdi, A., & Aldowaisan, T. (2000). No-wait and separate setup three-machine flowshop with total completion time criterion. International Transactions in Operational Research, 7(3), 245\u2013264.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"227_CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A. Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega-International Journal of Management Science, 27(2), 219\u2013239.","journal-title":"Omega-International Journal of Management Science"},{"key":"227_CR7","volume-title":"Introduction to sequencing and scheduling","author":"K. R. Baker","year":"1974","unstructured":"Baker, K. R. (1974). Introduction to sequencing and scheduling. New York: Wiley."},{"issue":"4","key":"227_CR8","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1057\/jors.1976.176","volume":"27","author":"M. C. Bonney","year":"1976","unstructured":"Bonney, M. C., & Gundry, S. W. (1976). Solutions to constrained flowshop sequencing problem. Operational Research Quarterly, 27(4), 869\u2013883.","journal-title":"Operational Research Quarterly"},{"issue":"6","key":"227_CR9","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1057\/palgrave.jors.2601695","volume":"55","author":"S. I. Brown","year":"2004","unstructured":"Brown, S. I., McGarvey, R., & Ventura, J. A. (2004). Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated. Journal of the Operational Research Society, 55(6), 614\u2013621.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"227_CR10","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/0360-8352(96)00042-3","volume":"30","author":"C. L. Chen","year":"1996","unstructured":"Chen, C. L., Neppalli, R. V., & Aljaber, N. (1996). Genetic algorithms applied to the continuous flow shop problem. Computers & Industrial Engineering, 30(4), 919\u2013929.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"227_CR11","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.1937-5956.2000.tb00137.x","volume":"9","author":"T. C. E. Cheng","year":"2000","unstructured":"Cheng, T. C. E., Gupta, J. N. D., & Wang, G. Q. (2000). A review of flowshop scheduling research with setup times. Production and Operations Management, 9(3), 262\u2013282.","journal-title":"Production and Operations Management"},{"issue":"6","key":"227_CR12","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0305-0548(91)90060-5","volume":"18","author":"P. Dileepan","year":"1991","unstructured":"Dileepan, P., & Sen, T. (1991). Job lateness in a two-machine flowshop with setup times separated. Computers & Operations Research, 18(6), 549\u2013556.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"227_CR13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1287\/opre.40.1.7","volume":"40","author":"R. A. Dudek","year":"1992","unstructured":"Dudek, R. A., Panwalkar, S. S., & Smith, M. L. (1992). The lessons of flowshop scheduling research. Operations Research, 40(1), 7\u201313.","journal-title":"Operations Research"},{"issue":"3","key":"227_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0925-5273(93)90042-J","volume":"32","author":"R. Gangadharan","year":"1993","unstructured":"Gangadharan, R., & Rajendran, C. (1993). Heuristic algorithms for scheduling in the no-wait flowshop. International Journal of Production Economics, 32(3), 285\u2013290.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"227_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"issue":"8","key":"227_CR16","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. Computers & Operations Research, 32(8), 2197\u20132212.","journal-title":"Computers & Operations Research"},{"key":"227_CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"227_CR18","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/nav.3800230206","volume":"23","author":"J. N. D. Gupta","year":"1976","unstructured":"Gupta, J. N. D. (1976). Optimal flowshop schedules with no intermediate storage space. Naval Research Logistics, 23(2), 235\u2013243.","journal-title":"Naval Research Logistics"},{"issue":"11","key":"227_CR19","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/S0305-0548(97)00018-X","volume":"24","author":"J. N. D. Gupta","year":"1997","unstructured":"Gupta, J. N. D., Strusevich, V. A., & Zwaneveld, C. M. (1997). Two-stage no-wait scheduling models with setup and removal times separated. Computers & Operations Research, 24(11), 1025\u20131031.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"227_CR20","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N. G. Hall","year":"1996","unstructured":"Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44(3), 510\u2013525.","journal-title":"Operations Research"},{"key":"227_CR21","volume-title":"Stochastic local search: foundations and applications","author":"H. H. Hoos","year":"2005","unstructured":"Hoos, H. H., & St\u00fctzle, T. (2005). Stochastic local search: foundations and applications. San Francisco: Kaufmann."},{"issue":"3","key":"227_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1080\/00207548008919673","volume":"18","author":"J. R. King","year":"1980","unstructured":"King, J. R., & Spachis, A. S. (1980). Heuristics for flowshop scheduling. International Journal of Production Research, 18(3), 345\u2013357.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"227_CR23","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1057\/jors.1972.90","volume":"23","author":"G. Liesegan","year":"1972","unstructured":"Liesegan, G., & Ruger, M. (1972). Flow-shop sequencing problem with no wait in process. Operational Research Quarterly, 23(4), 591\u2013598.","journal-title":"Operational Research Quarterly"},{"key":"227_CR24","first-page":"321","volume-title":"Handbook of metaheuristics","author":"H. R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H. R., Martin, O. C., & St\u00fctzle, T. (2003). Iterated local search. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 321\u2013353). Boston: Kluwer Academic."},{"issue":"1","key":"227_CR25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E. E. Jr., & Ham, I. (1983). A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega-International Journal of Management Science, 11(1), 91\u201395.","journal-title":"Omega-International Journal of Management Science"},{"issue":"6","key":"227_CR26","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I. H. Osman","year":"1989","unstructured":"Osman, I. H., & Potts, C. N. (1989). Simulated annealing for permutation flowshop scheduling. Omega-International Journal of Management Science, 17(6), 551\u2013557.","journal-title":"Omega-International Journal of Management Science"},{"key":"227_CR27","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling: theory, algorithms, and systems (2nd edn.). Upper Saddle River: Prentice-Hall.","edition":"2"},{"issue":"3","key":"227_CR28","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1080\/00207549108930084","volume":"29","author":"C. Proust","year":"1991","unstructured":"Proust, C., Gupta, J. N. D., & Deschamps, V. (1991). Flowshop scheduling with set-up, processing and removal times separated. International Journal of Production Research, 29(3), 479\u2013493.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"227_CR29","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1057\/jors.1994.65","volume":"45","author":"C. Rajendran","year":"1994","unstructured":"Rajendran, C. (1994). A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society, 45(4), 472\u2013478.","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"227_CR30","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1002\/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L","volume":"37","author":"C. Rajendran","year":"1990","unstructured":"Rajendran, C., & Chaudhuri, D. (1990). Heuristic algorithms for continuous flowshop problem. Naval Research Logistics, 37(5), 695\u2013705.","journal-title":"Naval Research Logistics"},{"issue":"6","key":"227_CR31","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1080\/095372897234902","volume":"8","author":"C. Rajendran","year":"1997","unstructured":"Rajendran, C., & Ziegler, H. (1997). Heuristics for scheduling in a flowshop with setup, processing and removal times separated. Production Planning & Control, 8(6), 568\u2013576.","journal-title":"Production Planning & Control"},{"issue":"1","key":"227_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01919082","volume":"28","author":"H. R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H. (1984a). Some new results in flow shop scheduling. Mathematical Methods of Operations Research (ZOR), 28(1), 1\u201316.","journal-title":"Mathematical Methods of Operations Research (ZOR)"},{"issue":"2","key":"227_CR33","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/62.65","volume":"31","author":"H. R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H. (1984b). The three-machine no-wait flow shop is NP-complete. Journal of the ACM, 31(2), 336\u2013345.","journal-title":"Journal of the ACM"},{"issue":"2","key":"227_CR34","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R. Ruiz","year":"2005","unstructured":"Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2), 479\u2013494.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"227_CR35","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R. Ruiz","year":"2007","unstructured":"Ruiz, R., & St\u00fctzle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033\u20132049.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"227_CR36","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ejor.2004.01.022","volume":"165","author":"R. Ruiz","year":"2005","unstructured":"Ruiz, R., Maroto, C., & Alcaraz, J. (2005). Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165(1), 34\u201354.","journal-title":"European Journal of Operational Research"},{"issue":"2\u20133","key":"227_CR37","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.cie.2004.06.006","volume":"47","author":"S. J. Shyu","year":"2004","unstructured":"Shyu, S. J., Lin, B. M. T., & Yin, P. Y. (2004). Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Computers & Industrial Engineering, 47(2\u20133), 181\u2013193.","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"227_CR38","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0167-6377(00)00019-5","volume":"26","author":"J. B. Sidney","year":"2000","unstructured":"Sidney, J. B., Potts, C. N., & Sriskandarajah, C. (2000). A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. Operations Research Letters, 26(4), 165\u2013173.","journal-title":"Operations Research Letters"},{"key":"227_CR39","unstructured":"St\u00fctzle, T. (1998). Applying iterated local search to the permutation flow shop problem. AIDA-98-04, FG Intellektik, TU Darmstadt."},{"issue":"3","key":"227_CR40","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1002\/nav.3800290313","volume":"29","author":"D. R. Sule","year":"1982","unstructured":"Sule, D. R. (1982). Sequencing n jobs on two machines with setup, processing and removal times separated. Naval Research Logistics, 29(3), 517\u2013519.","journal-title":"Naval Research Logistics"},{"issue":"5","key":"227_CR41","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1080\/00207548308942406","volume":"21","author":"D. R. Sule","year":"1983","unstructured":"Sule, D. R., & Huang, K. Y. (1983). Sequency on two and three machines with setup, processing and removal times separated. International Journal of Production Research, 21(5), 723\u2013732.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"227_CR42","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/ijoc.14.2.98.120","volume":"14","author":"J. P. Watson","year":"2002","unstructured":"Watson, J. P., Barbulescu, L., Whitley, L. D., & Howe, A. E. (2002). Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS Journal on Computing, 14(2), 98\u2013123.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"227_CR43","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1287\/opre.20.3.689","volume":"20","author":"D. A. Wismer","year":"1972","unstructured":"Wismer, D. A. (1972). Solution of flowshop-scheduling problem with no intermediate queues. Operations Research, 20(3), 689\u2013697.","journal-title":"Operations Research"},{"issue":"3","key":"227_CR44","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/05695557908974469","volume":"11","author":"T. Yoshida","year":"1979","unstructured":"Yoshida, T., & Hitomi, K. (1979). Optimal 2-stage production scheduling with setup times separated. AIIE Transactions, 11(3), 261\u2013263.","journal-title":"AIIE Transactions"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0227-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0227-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0227-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:42Z","timestamp":1559153262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-007-0227-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,23]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,9,13]]}},"alternative-id":["227"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0227-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,23]]}}}