How to cite this paper
Gupta, A & Chauhan, S. (2015). A heuristic algorithm for scheduling in a flow shop environment to minimize makespan.International Journal of Industrial Engineering Computations , 6(2), 173-184.
Refrences
Baker, K.R. (1974). Introduction to Sequencing and Scheduling. John Wiley & Sons, New York.
Behnamiana, J. & Ghomi, S.M.T. (2014). Multi-objective fuzzy multiprocessor flowshop scheduling. Applied Soft Computing, 21, 139–148.
Bhongade, A.S. & Khodke, P.M. (2012). Heuristics for production scheduling problem with machining and assembly operations. International Journal of Industrial Engineering Computations, 3, 185–198.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the `n’ job `m’ machine sequencing problem. Management Science, 16, B630-B637.
Chakraborty, U.K. & Laha, D. (2007). An improved heuristic for permutation flowshop scheduling. International Journal of Information and Communnication Technology, 1, 89–97.
Cheng, H.C., Chiang, T.C. & Fu, L.C. (2011). A two-stage hybrid memetic algorithm for multiobjective job shop scheduling. Expert Systems with Applications, 38, 9, 10983-10998.
Chia & Lee (2009). Minimizing the total completion time in permutation flow shop. Computers & Operations Research, 6, 2111-2121.
Chiang, T.C., Cheng, H.C. & Fu, L.C. (2011). NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Expert Systems with Applications, 38, 5, 5986–5999.
Choi, S.H. & Wang, K. (2012). Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach. Computers & Industrial Engineering, 63, 2, 362–373.
Danneberg, D., Tautenhahn, T. & Werner, F. (1999). A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size. Mathematical and Computer Modeling, 29(9), 101–126.
Dannenbring, D. G. (1977). An evaluation of flow shop sequencing heuristics. Management Science, 23, 1174-1182.
Fattahi, P., Hosseini, S.M.H. & Jolai, F. (2013). Some heuristics for the hybrid flow shop scheduling problem with setup and assembly operations. International Journal of Industrial Engineering Computations, 4, 393–416.
Gonzalez, T. & Sahni, S. (1978). Flow shop and job shop schedules. Operations Research, 26, 36–52.
Gupta, J. (1971). A functional heuristic algorithm for the flow shop scheduling problem. Operations Research Quarterly, 22, 39-47.
Hundal, T.S. & Rajgopal, J. (1988). An extension of Palmer & apos; s heuristic for the flow-shop scheduling problem. International Journal of Production Research, 26(6), 1119-1124.
Jabbarizadeh, F., Zandieh, M. & Talebi D. (2009). Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints. Computers & Industrial Engineering, 57, 949–957.
Jaros?aw, P., Czes?aw, S. & Dominik, Z. (2013), Optimizing Bicriteria Flow Shop Scheduling Problem by Simulated Annealing Algorithm. Procedia Computer Science, 18, 936–945.
Johnson, S.M. (1954). Optimal two and three-stage production schedules with set-up times included. Naval Research Logistics Quarterly, 1, 61-68.
Khalili, M. & Reza, M.T. (2012). A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem. Journal of Manufacturing Systems, 31(2), 232–239.
Li, Z.T., Chen, Q., Mao, N.,Wang, X. & Liu, J. (2013). Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraint. International Journal of Production Economics, 146, 2, 667–678.
Nawaz, M., Enscore Jr. E. E., & Ham, I. (1983). A heuristic algorithm for the `m’ machine, `n’ job flow shop sequencing problem. OMEGA, 11, 91-95.
Palmer, D. S. (1965). Sequencing jobs through a multi stage process in the minimum total time - a quick method of obtaining a near optimum. Operational Research Quarterly, 16, 101-107.
Pour, N.S., Moghaddam, R.T. & Asadi, H. (2013). Optimizing a multi-objectives flow shop scheduling problem by a novel genetic algorithm. International Journal of Industrial Engineering Computations, 4, 345–354.
Rahmani, D. & Heydari, M. (2014). Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times. Journal of Manufacturing Systems, 33, 1, 84–92.
Rajendran, C. & Ziegler, H. (1997). An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Jounal Operation Research, 103, 129 –138.
Rajendran, C. (1994). A heuristic for scheduling on flow shop and flow line based manufacturing cell with multi criteria. International Journal of Production Research, 32, 2541-2558.
Ruiz, R. & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165, 479–494.
Ruiz, R. & Stutzle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177, 2033–2049.
Sayadi, M.K., Ramezanian, R. & Nasab, N.G. (2010). A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations, 1, 1–10.
Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.
Wang, K. & Choi, S.H. (2014). A holonic approach to flexible flow shop scheduling under stochastic processing times. Computers & Operations Research, 43, 157–168.
Wang, L., Pan, Q.K, Suganthan, P.N., Wang, W.H. & Wang, Y.M. (2010). A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Computers & Operations Research, 37, 3, 509–520.
Yang, S.H. & Wang, J.B. (2011). Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration. Applied Mathematics and Computation, 217, 4819-4826.
Zobolas, G.I., Tarantilis, C.D. & Ioannou, G. (2009). Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research, 36, 1249 – 1267.
Behnamiana, J. & Ghomi, S.M.T. (2014). Multi-objective fuzzy multiprocessor flowshop scheduling. Applied Soft Computing, 21, 139–148.
Bhongade, A.S. & Khodke, P.M. (2012). Heuristics for production scheduling problem with machining and assembly operations. International Journal of Industrial Engineering Computations, 3, 185–198.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the `n’ job `m’ machine sequencing problem. Management Science, 16, B630-B637.
Chakraborty, U.K. & Laha, D. (2007). An improved heuristic for permutation flowshop scheduling. International Journal of Information and Communnication Technology, 1, 89–97.
Cheng, H.C., Chiang, T.C. & Fu, L.C. (2011). A two-stage hybrid memetic algorithm for multiobjective job shop scheduling. Expert Systems with Applications, 38, 9, 10983-10998.
Chia & Lee (2009). Minimizing the total completion time in permutation flow shop. Computers & Operations Research, 6, 2111-2121.
Chiang, T.C., Cheng, H.C. & Fu, L.C. (2011). NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Expert Systems with Applications, 38, 5, 5986–5999.
Choi, S.H. & Wang, K. (2012). Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach. Computers & Industrial Engineering, 63, 2, 362–373.
Danneberg, D., Tautenhahn, T. & Werner, F. (1999). A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size. Mathematical and Computer Modeling, 29(9), 101–126.
Dannenbring, D. G. (1977). An evaluation of flow shop sequencing heuristics. Management Science, 23, 1174-1182.
Fattahi, P., Hosseini, S.M.H. & Jolai, F. (2013). Some heuristics for the hybrid flow shop scheduling problem with setup and assembly operations. International Journal of Industrial Engineering Computations, 4, 393–416.
Gonzalez, T. & Sahni, S. (1978). Flow shop and job shop schedules. Operations Research, 26, 36–52.
Gupta, J. (1971). A functional heuristic algorithm for the flow shop scheduling problem. Operations Research Quarterly, 22, 39-47.
Hundal, T.S. & Rajgopal, J. (1988). An extension of Palmer & apos; s heuristic for the flow-shop scheduling problem. International Journal of Production Research, 26(6), 1119-1124.
Jabbarizadeh, F., Zandieh, M. & Talebi D. (2009). Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints. Computers & Industrial Engineering, 57, 949–957.
Jaros?aw, P., Czes?aw, S. & Dominik, Z. (2013), Optimizing Bicriteria Flow Shop Scheduling Problem by Simulated Annealing Algorithm. Procedia Computer Science, 18, 936–945.
Johnson, S.M. (1954). Optimal two and three-stage production schedules with set-up times included. Naval Research Logistics Quarterly, 1, 61-68.
Khalili, M. & Reza, M.T. (2012). A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem. Journal of Manufacturing Systems, 31(2), 232–239.
Li, Z.T., Chen, Q., Mao, N.,Wang, X. & Liu, J. (2013). Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraint. International Journal of Production Economics, 146, 2, 667–678.
Nawaz, M., Enscore Jr. E. E., & Ham, I. (1983). A heuristic algorithm for the `m’ machine, `n’ job flow shop sequencing problem. OMEGA, 11, 91-95.
Palmer, D. S. (1965). Sequencing jobs through a multi stage process in the minimum total time - a quick method of obtaining a near optimum. Operational Research Quarterly, 16, 101-107.
Pour, N.S., Moghaddam, R.T. & Asadi, H. (2013). Optimizing a multi-objectives flow shop scheduling problem by a novel genetic algorithm. International Journal of Industrial Engineering Computations, 4, 345–354.
Rahmani, D. & Heydari, M. (2014). Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times. Journal of Manufacturing Systems, 33, 1, 84–92.
Rajendran, C. & Ziegler, H. (1997). An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Jounal Operation Research, 103, 129 –138.
Rajendran, C. (1994). A heuristic for scheduling on flow shop and flow line based manufacturing cell with multi criteria. International Journal of Production Research, 32, 2541-2558.
Ruiz, R. & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165, 479–494.
Ruiz, R. & Stutzle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177, 2033–2049.
Sayadi, M.K., Ramezanian, R. & Nasab, N.G. (2010). A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations, 1, 1–10.
Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.
Wang, K. & Choi, S.H. (2014). A holonic approach to flexible flow shop scheduling under stochastic processing times. Computers & Operations Research, 43, 157–168.
Wang, L., Pan, Q.K, Suganthan, P.N., Wang, W.H. & Wang, Y.M. (2010). A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Computers & Operations Research, 37, 3, 509–520.
Yang, S.H. & Wang, J.B. (2011). Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration. Applied Mathematics and Computation, 217, 4819-4826.
Zobolas, G.I., Tarantilis, C.D. & Ioannou, G. (2009). Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research, 36, 1249 – 1267.