A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times

References

• Chen, H., Zhou, S., Li, X., & Xu, R. (2014). A hybrid differential evolution algorithm for a two-stage flow shop on batch processing machines with arbitrary release times and blocking. International Journal of Production Research, 52(19), 5714–5734.10.1080/00207543.2014.910625
   Web of Science ®Google Scholar
• 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, 55, 1243–1255.10.1057/palgrave.jors.2601784
   Web of Science ®Google Scholar
• Gilmore, P. C., & Gomory, R. E. (1964). Sequencing a one state-variable machine: A solvable case of the travelling salesman problem. Operations Research, 12(5), 655–679.10.1287/opre.12.5.655
   Web of Science ®Google Scholar
• 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.10.1287/opre.44.3.510
   Web of Science ®Google Scholar
• Ignall, E., & Schrage, L. (1965). Application of the branch and bound technique to some flow-shop scheduling problems. Operations Research: The journal of the Operations Research Society of America, 13(3), 400–412.10.1287/opre.13.3.400
   Web of Science ®Google Scholar
• Kim, Y.-D. (1995). Minimizing mean tardiness inpermutation flowshops. European Journal of Operational Research, 85(3), 541–555.10.1016/0377-2217(94)00029-C
   Web of Science ®Google Scholar
• Leisten, R. (1990). Flowshop sequencing problems with limited buffer storage. International Journal of Production Research, 28(11), 2085–2100.10.1080/00207549008942855
   Web of Science ®Google Scholar
• Maleki-Darounkolaei, A., Modiri, M., Tavakkoli-Moghaddam, R., & Seyyedi, I. (2012). A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times. Journal of Industrial Engineering International, 8–26.
   Google Scholar
• McCormick, S. T., Pinedo, M. L., Shenker, S., & Wolf, B. (1989, йил Novembro). Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37(6), 925–935.10.1287/opre.37.6.925
   Web of Science ®Google Scholar
• Moslehi, G., & Khorasanian, D. (2013). Optimizing blocking flow shop scheduling problem with total completion time criterion. Computer and Operations Research, 40(7), 1874–1883.10.1016/j.cor.2013.02.003
   Web of Science ®Google Scholar
• 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.10.1016/0305-0483(83)90088-9
   Web of Science ®Google Scholar
• Norman, B. A. (1999). Scheduling flowshops with finite buffers and sequence-dependent setup times. Computer & Industrial Engineering, 36(1), 163–177.10.1016/S0360-8352(99)00007-8
   Web of Science ®Google Scholar
• Pan, Q. K., & Wang, L. (2012). Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega, 40(2), 218–229.10.1016/j.omega.2011.06.002
   Web of Science ®Google Scholar
• Papadimitriou, C., & Kanellakis, P. (1980). Flow-shop scheduling with limited temporary storage. Journal of the Association for Computing Machinery, 27(3), 533–549.10.1145/322203.322213
   Web of Science ®Google Scholar
• Pranzo, M. (2004). Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times. European Journal of Operational Research, 153(3), 581–592.10.1016/S0377-2217(03)00264-9
   Web of Science ®Google Scholar
• Reddi, S. S., & Ramamoorthy, C. V. (1972). Flowshop sequencing problem with no wait in process. Operational Research Quarterly, 23(3), 323–331.10.1057/jors.1972.52
   Google Scholar
• Ronconi, D. P. (2004). A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics, 87(1), 39–48.10.1016/S0925-5273(03)00065-3
   Web of Science ®Google Scholar
• Ronconi, D. P. (2005, Setembro). A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Annals of Operations Research, 138(1), 53–65.10.1007/s10479-005-2444-3
   Web of Science ®Google Scholar
• Ronconi, D. P., & Armentano, V. A. (2001). Lower bounding schemes for flowshops with blocking in-process. Journal of the Operational Research Society, 52(11), 1289–1297.10.1057/palgrave.jors.2601220
   Web of Science ®Google Scholar
• Ronconi, D. P., & Birgin, E. G. (2012). Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness. Just-in-Time Systems, 91–105.10.1007/978-1-4614-1123-9
   Google Scholar
• Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278–285.10.1016/0377-2217(93)90182-M
   Web of Science ®Google Scholar