A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

Ng CT, Wang JB, Cheng TCE, Liu LL: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Comput Oper Res 2010,37(1):83–90. 10.1016/j.cor.2009.03.019 Allahverdi A, Al-Anzi FS: The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. Int J Adv Manuf Technol 2007,37(1):166–177. Koulamas S, Kyparisis G: The three-stage assembly flowshop scheduling problem. Comput Oper Res 2001,28(7):689–704. 10.1016/S0305-0548(00)00004-6 Al-Anzi FS, Allahverdi A: Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan. Comput Oper Res 2009,36(9):2682–2689. 10.1016/j.cor.2008.11.018 Hatami S, Ebrahimnejad S, Tavakkoli-Moghaddam R, Maboudian Y: Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times. Int J Adv Manuf Technol 2010, 50: 1153–1164. 10.1007/s00170-010-2579-5 Tavakkoli-Moghaddam R, Safaei N, Sassani F: A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Comput Oper Res 2009,36(2):402–414. 10.1016/j.cor.2007.10.011 Hall NG, Sriskandarajah C: A survey of machine scheduling problems with blocking and no wait in process. Oper Res 1996,44(3):510–525. 10.1287/opre.44.3.510 Yokoyama M, Santos DL: Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times. Eur J Oper Res 2005,161(3):754–770. 10.1016/j.ejor.2003.09.016 Allahverdi A, Al-Anzi FS: The two-stage assembly scheduling problem to minimize total completion time with setup times. Comput Oper Res 2009,36(10):2740–2747. 10.1016/j.cor.2008.12.001 Lee CY, Cheng TCE, Lin BMT: Minimizing the makespan in the 3-machine assembly type flowshop scheduling problem. Manag Sci 1993,39(5):616–625. 10.1287/mnsc.39.5.616 Cheng TCE, Lin BMT, Tian Y: Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times. Comput Oper Res 2009,36(11):3031–3040. 10.1016/j.cor.2009.02.001 Ruiz R, Allaherdi A: Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. Comput Oper Res 2009,36(4):1268–1283. 10.1016/j.cor.2007.12.013 Sun X, Morizawa K, Nagasawa H: Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling. Eur J Oper Res 2003,146(3):498–516. 10.1016/S0377-2217(02)00245-X Qian B, Wang L, Huang DX, Wang W, Wang X: An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Comput Oper Res 2009,36(1):209–233. 10.1016/j.cor.2007.08.007 Liu B, Wang L, Jin YH: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers. Comput Oper Res 2008,35(9):2791–2806. 10.1016/j.cor.2006.12.013 Wang L, Zhang L, Zheng DZ: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Comput Oper Res 2006,33(10):2960–2971. 10.1016/j.cor.2005.02.028 Grabowski J, Pempera J: The permutation flowshop problem with blocking .A tabu search approach. Omega 2007,35(3):302–311. 10.1016/j.omega.2005.07.004 Ronconi DP: A note on constructive heuristics for the flowshop problem with blocking. Int J Prod Econ 2004,87(1):39–48. 10.1016/S0925-5273(03)00065-3 Sawik T: Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Math Comput Model 2000,31(13):39–52. 10.1016/S0895-7177(00)00110-2 Norman AB: scheduling flowshops with finite buffers and sequence-dependent setup times. Comput Ind Eng 1999,36(1):163–177. 10.1016/S0360-8352(99)00007-8 Ronconi DP, Henriques LRS: Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega 2009,37(2):272–281. 10.1016/j.omega.2007.01.003 Tozkapan A, Kirca O, Chung CS: A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Comput Oper Res 2003,30(2):309–320. 10.1016/S0305-0548(01)00098-3 Yagmahan B, Yenisey MM: A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Syst Appl 2010,37(2):1361–1368. 10.1016/j.eswa.2009.06.105 Sung CS, Kim HK: A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times. Int J Prod Econ 2008,113(2):1038–1048. 10.1016/j.ijpe.2007.12.007 Yokoyama Y: Flow-shop scheduling with setup and assembly operations. Eur J Oper Res 2008,161(3):754–770. Liu SQ, Kozan E: scheduling a flow shop with combined buffer conditions. Int J Prod Econ 2009,117(2):371–380. 10.1016/j.ijpe.2008.11.007 Lee WC, Shiuan YR, Chen SK, Wu CC: A two-machine flowshop scheduling problem with deteriorating jobs and blocking. Int J Prod Econ 2010,124(1):188–197. 10.1016/j.ijpe.2009.11.001 Gong H, Tang L, Duin CW: A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Comput Oper Res 2010,37(5):960–969. 10.1016/j.cor.2009.08.001 Wang L, Pan QK, Suganthan PN, Wang WH, Wang YM: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 2010,37(3):509–520. 10.1016/j.cor.2008.12.004 Metropolis N, Rosenbluth AW, Teller AH: Equation of state calculations by fast computing machines. J Chem Phys 1953, 1087–1092. Lin SW, Ying KC, Lee ZJ: Meta-heuristics for scheduling a non-permutation flow line manufacturing cell with sequence dependent family setup times. Comput Oper Res 2009,36(4):1110–1121. 10.1016/j.cor.2007.12.010