New heuristics to minimize total completion time in m-machine flowshops

Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 69, 10.1002/nav.3800010110 Gonzalez, 1978, Flow shop and job shop schedules, Operations Research, 26, 36, 10.1287/opre.26.1.36 Van De Velde, 1990, Minimizing the sum of job completion times in the two-machine flow-shop by Lagrangean relaxation, Annals of Operations Research, 26, 257, 10.1007/BF03500931 Cadambi, 1993, Two-machine flowshop scheduling to minimize mean flow time, Opsearch, 30, 35 Allahverdi, 1994, Two-machine ordered flowshop scheduling under random breakdowns, Mathematical and Computer Modeling, 20, 9, 10.1016/0895-7177(94)90202-X Della Croce, 1996, The two-machine total completion time flow shop problem, European Journal of Operational Research, 90, 227, 10.1016/0377-2217(95)00351-7 Allahverdi, 2000, Minimizing mean flowtime in a two-machine flowshop with sequence independent setup times, Computers & Operations Research, 27, 111, 10.1016/S0305-0548(99)00010-6 Allahverdi, Stochastically minimizing total flowtime in flowshops with no waiting space, European Journal of Operational Research 113 (1999) 101–112. Bansal, 1977, Minimizing the sum of completion times of n-jobs over m machines in a flow shop, AIIE Transactions, 9, 306, 10.1080/05695557708975160 Ahmadi, 1990, Improved lower bounds for minimizing the sum of flowtimes of n jobs over m machines in a flow shop, European Journal of Operational Research, 44, 331, 10.1016/0377-2217(90)90244-6 Karabati, 1993, The permutation flow shop problem with sum-of-completion times performance criterion, Naval Research Logistics, 40, 843, 10.1002/1520-6750(199310)40:6<843::AID-NAV3220400608>3.0.CO;2-A Ho, 1991, A new heuristic for the n-job, m-machine flow-shop problem, European Journal of Operational Research, 52, 194, 10.1016/0377-2217(91)90080-F Rajendran, D. Chaudhuri, An efficient heuristic approach to the scheduling of jobs in a flowshop, European Journal of Operational Research 61 (1991) 318–325. Rajendran, Heuristic algorithm for scheduling in flowshop to minimize total flowtime, International Journal of Production Economics 29 (1993) 65–73. Ho, 1995, Flowshop sequencing with mean flowtime objective, European Journal of Operational Research, 81, 571, 10.1016/0377-2217(93)E0353-Y Wang, C. Chu, J.M. Proth, Heuristic approaches for n/m/F/∑Ci scheduling problem, European Journal of Operational Research 96 (1997) 636–644. Rajendran, 1997, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, European Journal of Operational Research, 103, 129, 10.1016/S0377-2217(96)00273-1 Woo, 1998, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Computers & Operations Research, 25, 175, 10.1016/S0305-0548(97)00050-6 Campbell, 1970, A heuristic algorithm for the n-job, m-machine sequencing problem, Management Science, 16, B630, 10.1287/mnsc.16.10.B630 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flowshop sequencing problem, OMEGA The International Journal of Management Sciences, 11, 91, 10.1016/0305-0483(83)90088-9 Wang, 1997, Minimizing makespan in a class of reentrant shops, Operations Research, 45, 702, 10.1287/opre.45.5.702 Pan, 1997, Scheduling alternative operations in two-machine flow-shops, Journal of the Operational Research Society, 48, 533, 10.1057/palgrave.jors.2600397 Sundararaghavan, 1997, Minimizing makespan in parallel flowshops, Journal of the Operational Research Society, 48, 834, 10.1057/palgrave.jors.2600408 Rajendran, 1990, Heuristic algorithms for continuous flowshop problem, Naval Research Logistics, 37, 695, 10.1002/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L