How to cite this paper
Nailwal, K., Gupta, D & Jeet, K. (2016). Heuristics for no-wait flow shop scheduling problem.International Journal of Industrial Engineering Computations , 7(4), 671-680.
Refrences
Akhshabi, M., Tavakkoli-Moghaddam, R., & Rahnamay-Roodposhti, F. (2014). A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time. The International Journal of Advanced Manufacturing Technology, 70(5), 1181-1188.
Aldowaisan, T., & Allahverdi, A. (1998). Total flowtime in no-wait flow shops with setup times. Computers and Operations Research, 25(9), 757-765.
Aldowaisan, T., & Allahverdi, A. (2003). New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research, 30(8), 1219-1231.
Aldowaisan, T., & Allahverdi, A. (2004). A new heuristic for m-machine no-wait flow shop to minimize total completion time. Omega, 32(5), 345-352.
Allahverdi, A., & Aldowaisan, T. (2000). No-wait and separate setup three-machine flow shop with total completion time criterion. International Transactions in Operational Research, 7(3), 245-264.
Baker, K. R. (1974). Introduction to Sequencing and Scheduling, New York, John Wiley and Sons .
Bertolissi, E. (2000). Heuristic algorithm for scheduling in the no-wait flow-shop. Journal of Materials Processing Technology,107(1-3), 459-465.
Bonney, M. C., & Gundry, S. W. (1976). Solutions to the constrained flow shop sequencing problem. Operations Research Quarterly, 27(4), 869-883.
Chaudhry, I. A., & Khan, A. M. (2012). Minimizing makespan for a no-wait flowshop using genetic algorithm. Sadhana, 37(6), 695-707.
Chen, C., Neppalli, R. V., & Aljaber, N. (1996). Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering, 30(4), 919-929.
Ding, J.Y., Song, S., Gupta, J.N.D., Rui, Z., & Raymond, C. (2015). An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing, 30, 604-613.
Fink, A., & Voß, S., (2003). Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research, 151(2), 400-414.
Framinan, J. M., Gupta, J. N., & Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 1243-1255.
Gangadharan, R., & Rajendran, C. (1993). Heuristic algorithms for scheduling in the no-wait flowshop. International Journal of Production Economics,32(3), 285-290.
Gao, K., Pan, Q., Suganthan, P. N., & Li, J. (2013). Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization. The International Journal of Advanced Manufacturing Technology, 66(9-12), 1563-1572.
Grabowski, J., & Pempera, J.L. (2005). Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers and Operations Research, 32(8), 2197-2212.
Gupta, J.N.D. (1976). Optimal flowshop schedules with no intermediate storage space. Naval Research Logistics Quarterly, 23(2), 235–243.
Hall, N.G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44(3), 510-525.
Johnson, S.M. (1954). Optimal two and three stage production schedule with setup time included. Naval Research Logistics Quartertly, 1, 61-68.
King, J.R., & Spachis, A.S., (1980). Heuristics for flow shop scheduling. International Journal of Production Research, 18(3), 343-357.
Komaki, GH. M., & Kayvanfar, V, (2012). Solving No-wait Flow shop by Heuristic Algorithm. Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 - 6.
Laha, D., & Chakraborty, U.K., (2009). A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 41(1-2), 97-109.
Laha, D, Sapkal, S.U. (2014). An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop. Computers & Industrial Engineering, 67, 36–43.
Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91-95.
Pan, Q. K., Tasgetiren, M. F., & Liang, Y. C. (2008). A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem.Computers & Operations Research, 35(9), 2807-2839.
Pan, Q.K., Wang, L., & Zhao, B.H. (2008a). An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion, The International Journal of Advanced Manufacturing Technology, 38(7), 778–786.
Pinedo, M. L. (2002). Scheduling: theory, Algorithms, and Systems. Prentice- Hall, NJ: Upper Saddle.
Rajendran, C. (1994). A no-wait flow shop scheduling heuristic to minimize makespan. Journal of the Operational Research Society, 45(4), 472-478.
Rajendran, C., & Chaudhuri, D. (1990). Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics Quarterly, 37(5), 695-705.
Reddi, S.S., & Ramamoorthy, C. V. (1972). On the flow shop sequencing problem with no-wait in process. Operations Research Quarterly, 23, 323-331.
Riyanto, O.A.W., Santosa, B. (2015). ACO-LS Algorithm for Solving No-wait Flow Shop Scheduling Problem, in Intan, R., Chi, C-H, Palit, H.N., & Santoso, L.W. (Eds.), Intelligence in the Era of Big Data, Vol. 516 of the series Communications in Computer and Information Science, Springer Berlin Heidelberg, , pp. 89-97.
Rock, H. (1980). The three-machine no-wait flowshop problem is NP-complete. Journal of Association for Computing Machinery, 31(2), 336-345.
Szwarc, W. (1981). A note on the flow-shop problem without interruptions in job processing. Naval Research Logistics Quarterly, 28(4), 665-669.
Szwarc, W. (1983). Solvable cases of the flow-shop problem without interruptions in job processing. Naval Research Logistics Quarterly, 30(1), 179-183.
Tseng, L.Y., & Lin, Y.T. (2010). A hybrid genetic algorithm for no-wait flowshop scheduling problem, International Journal of Production Economics, 128 (1), 144–152.
Van der Veen, J.A.A., & Van Dal, R., (1991). Solvable cases of the no-wait flow-shop scheduling problem. Journal of the Operational Research Society, 42(11), 971–980.
Van Deman, J.M., & Baker, K. R., (1974). Minimizing mean flowtime in the flowshop with no intermediate queues. AIIE Transactions, 6(1), 28-34.
Wismer, D. A., (1972). Solution of the flow shop-scheduling with no intermediate queues. Operations Research, 20(3), 689-697.
Aldowaisan, T., & Allahverdi, A. (1998). Total flowtime in no-wait flow shops with setup times. Computers and Operations Research, 25(9), 757-765.
Aldowaisan, T., & Allahverdi, A. (2003). New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research, 30(8), 1219-1231.
Aldowaisan, T., & Allahverdi, A. (2004). A new heuristic for m-machine no-wait flow shop to minimize total completion time. Omega, 32(5), 345-352.
Allahverdi, A., & Aldowaisan, T. (2000). No-wait and separate setup three-machine flow shop with total completion time criterion. International Transactions in Operational Research, 7(3), 245-264.
Baker, K. R. (1974). Introduction to Sequencing and Scheduling, New York, John Wiley and Sons .
Bertolissi, E. (2000). Heuristic algorithm for scheduling in the no-wait flow-shop. Journal of Materials Processing Technology,107(1-3), 459-465.
Bonney, M. C., & Gundry, S. W. (1976). Solutions to the constrained flow shop sequencing problem. Operations Research Quarterly, 27(4), 869-883.
Chaudhry, I. A., & Khan, A. M. (2012). Minimizing makespan for a no-wait flowshop using genetic algorithm. Sadhana, 37(6), 695-707.
Chen, C., Neppalli, R. V., & Aljaber, N. (1996). Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering, 30(4), 919-929.
Ding, J.Y., Song, S., Gupta, J.N.D., Rui, Z., & Raymond, C. (2015). An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing, 30, 604-613.
Fink, A., & Voß, S., (2003). Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research, 151(2), 400-414.
Framinan, J. M., Gupta, J. N., & Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 1243-1255.
Gangadharan, R., & Rajendran, C. (1993). Heuristic algorithms for scheduling in the no-wait flowshop. International Journal of Production Economics,32(3), 285-290.
Gao, K., Pan, Q., Suganthan, P. N., & Li, J. (2013). Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization. The International Journal of Advanced Manufacturing Technology, 66(9-12), 1563-1572.
Grabowski, J., & Pempera, J.L. (2005). Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers and Operations Research, 32(8), 2197-2212.
Gupta, J.N.D. (1976). Optimal flowshop schedules with no intermediate storage space. Naval Research Logistics Quarterly, 23(2), 235–243.
Hall, N.G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44(3), 510-525.
Johnson, S.M. (1954). Optimal two and three stage production schedule with setup time included. Naval Research Logistics Quartertly, 1, 61-68.
King, J.R., & Spachis, A.S., (1980). Heuristics for flow shop scheduling. International Journal of Production Research, 18(3), 343-357.
Komaki, GH. M., & Kayvanfar, V, (2012). Solving No-wait Flow shop by Heuristic Algorithm. Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 - 6.
Laha, D., & Chakraborty, U.K., (2009). A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 41(1-2), 97-109.
Laha, D, Sapkal, S.U. (2014). An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop. Computers & Industrial Engineering, 67, 36–43.
Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91-95.
Pan, Q. K., Tasgetiren, M. F., & Liang, Y. C. (2008). A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem.Computers & Operations Research, 35(9), 2807-2839.
Pan, Q.K., Wang, L., & Zhao, B.H. (2008a). An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion, The International Journal of Advanced Manufacturing Technology, 38(7), 778–786.
Pinedo, M. L. (2002). Scheduling: theory, Algorithms, and Systems. Prentice- Hall, NJ: Upper Saddle.
Rajendran, C. (1994). A no-wait flow shop scheduling heuristic to minimize makespan. Journal of the Operational Research Society, 45(4), 472-478.
Rajendran, C., & Chaudhuri, D. (1990). Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics Quarterly, 37(5), 695-705.
Reddi, S.S., & Ramamoorthy, C. V. (1972). On the flow shop sequencing problem with no-wait in process. Operations Research Quarterly, 23, 323-331.
Riyanto, O.A.W., Santosa, B. (2015). ACO-LS Algorithm for Solving No-wait Flow Shop Scheduling Problem, in Intan, R., Chi, C-H, Palit, H.N., & Santoso, L.W. (Eds.), Intelligence in the Era of Big Data, Vol. 516 of the series Communications in Computer and Information Science, Springer Berlin Heidelberg, , pp. 89-97.
Rock, H. (1980). The three-machine no-wait flowshop problem is NP-complete. Journal of Association for Computing Machinery, 31(2), 336-345.
Szwarc, W. (1981). A note on the flow-shop problem without interruptions in job processing. Naval Research Logistics Quarterly, 28(4), 665-669.
Szwarc, W. (1983). Solvable cases of the flow-shop problem without interruptions in job processing. Naval Research Logistics Quarterly, 30(1), 179-183.
Tseng, L.Y., & Lin, Y.T. (2010). A hybrid genetic algorithm for no-wait flowshop scheduling problem, International Journal of Production Economics, 128 (1), 144–152.
Van der Veen, J.A.A., & Van Dal, R., (1991). Solvable cases of the no-wait flow-shop scheduling problem. Journal of the Operational Research Society, 42(11), 971–980.
Van Deman, J.M., & Baker, K. R., (1974). Minimizing mean flowtime in the flowshop with no intermediate queues. AIIE Transactions, 6(1), 28-34.
Wismer, D. A., (1972). Solution of the flow shop-scheduling with no intermediate queues. Operations Research, 20(3), 689-697.