How to cite this paper
Souza, E., Nagano, M., Miyata, H & Abreu, L. (2023). Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times.Journal of Project Management, 8(2), 99-118.
Refrences
Agnetis, A. & Mosheiov, G. (2017). Scheduling with Job-Rejection and Position-Dependent Processing Times on Pro-portionate Flowshops. Optimization Letters, 11(4), 885–92.
Allahverdi, A. (2015). The Third Comprehensive Survey on Scheduling Problems with Setup Times/Costs. European Journal of Operational Research, 246(2), 345–78.
Allahverdi, A., Ng, C. T., Cheng, T. C. E. & Kovalyov, M. Y. (2008). A Survey of Scheduling Problems with Setup Times or Costs. European Journal of Operational Research, 187(3), 985–1032.
Bautista, J. & Pereira J. (2009). A Dynamic Programming Based Heuristic for the Assembly Line Balancing Problem. European Journal of Operational Research, 194(3), 787–94.
Bautista, J., Cano, A., Companys, R. & Ribas, I. (2012). Solving the Fm/ Block/ Cmax Problem Using Bounded Dynam-ic Programming. Engineering Applications of Artificial Intelligence, 25(6), 1235–45.
Fernandez-Viagas, V., Leisten, R. & Framinan, J. M. (2016). A Computational Evaluation of Constructive and Im-provement Heuristics for the Blocking Flow Shop to Minimise Total Flowtime. Expert Systems with Applications, 61, 290–301.
Gong, H., Tang, L. & Duin, C. W. (2010). A Two-Stage Flow Shop Scheduling Problem on a Batching Machine and a Discrete Machine with Blocking and Shared Setup Times. Computers & Operations Research, 37(5), 960–69.
Graham, R. L., Lawler, E. L., Lenstra, J. K. & Kan, A. H. G. R. (1979). Optimization and Approximation in Determinis-tic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics, 5, 287–326.
Gupta, J. N. D. & Stafford Jr., E. F. (2006). Flowshop Scheduling Research After Five Decades. European Journal of Operational Research, 169(3), 699–711.
Hon, K. K. B. (2005). Performance and Evaluation of Manufacturing Systems. CIRP Annals, 54(2), 139–54.
Ignall, E. & Schrage, L. (1965). Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Prob-lems. Operations Research, 13(3), 400–412.
Johnson, S. M. (1954). Optimal Two-and Three-Stage Production Schedules with Setup Times Included. Naval Research Logistics Quarterly, 1(1), 61–68.
Koren, Y., Heisel, U., Jovane, F., Moriwaki, T., Pritschow, G., Ulsoy, G. & Brussel H. V. (1999). Reconfigurable Manu-facturing Systems. CIRP Annals, 48(2), 527–40.
Lawler, E. L. & Moore, J. M. (1969). A Functional Equation and Its Application to Resource Allocation and Sequencing Problems. Management Science, 16(1), 77–84.
Lepuschitz, W., Zoitl, A., Vallée, M. & Merdan, M. (2010). Toward Self-Reconfiguration of Manufacturing Systems Using Automation Agents. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Re-views), 41(1), 52–69.
Li, S. S. & Yuan, J. J. (2020). Single-Machine Scheduling with Multi-Agents to Minimize Total Weighted Late Work. Journal of Scheduling, 23, 497–512.
Maccarthy, B. L. & Liu, J. (1993). Addressing the Gap in Scheduling Research: A Review of Optimization and Heuristic Methods in Production Scheduling. The International Journal of Production Research, 31(1), 59–79.
Mahalik, N. P. & Nambiar, A. N. (2010). Trends in Food Packaging and Manufacturing Systems and Technology. Trends in Food Science & Technology, 21(3), 117–28.
Martinez, S., Dauzère-Pérès, S., Gueret, C., Mati, Y. & Sauer., N. (2006). Complexity of Flowshop Scheduling Problems with a New Blocking Constraint. European Journal of Operational Research, 169(3), 855–64.
Merchan, A. F. & Maravelias, C. T. (2016). Preprocessing and Tightening Methods for Time-Indexed MIP Chemical Production Scheduling Models. Computers & Chemical Engineering, 84, 516–35.
Miyata, H. H. & Nagano, M. S. (2019). The Blocking Flow Shop Scheduling Problem: A Comprehensive and Conceptu-al Review. Expert Systems with Applications, 137, 130–56.
Moore, J. M. (1968). An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs. Manage-ment Science, 15(1), 102–9.
Mor, B. & Shapira., D. (2020). Regular Scheduling Measures on Proportionate Flowshop with Job Rejection. Computa-tional and Applied Mathematics, 39(2), 1–14.
Newton, M. A. H., Riahi, V., Su, K. & Sattar, A. (2019). Scheduling Blocking Flowshops with Setup Times via Con-straint Guided and Accelerated Local Search. Computers & Operations Research, 109, 64–76.
Ozolins, A. (2018). Bounded Dynamic Programming Algorithm for the Job Shop Problem with Sequence Dependent Setup Times. Operational Research, 20, 1701–1728.
Ozolins, A. (2019a). Dynamic Programming Approach for Solving the Open Shop Problem. Central European Journal of Operations Research, 29, 291–306.
Ozolins, A. (2019b). Improved Bounded Dynamic Programming Algorithm for Solving the Blocking Flow Shop Prob-lem. Central European Journal of Operations Research, 27(1), 15–38.
Pinedo, M. (2012). Scheduling. Springer.
Potts, C. N. & Wassenhove, L. N. V. (1985). A Branch and Bound Algorithm for the Total Weighted Tardiness Problem. Operations Research, 33(2), 363–77.
Ribas, I., Companys, R. & Tort-Martorell, X. (2015). An Efficient Discrete Artificial Bee Colony Algorithm for the Blocking Flow Shop Problem with Total Flowtime Minimization. Expert Systems with Applications, 42(15-16), 6155–67.
Ronconi, D. P. (2005). A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking. Annals of Operations Research, 138(1), 53–65.
Seow, Y. & Rahimifard, S. (2011). A Framework for Modelling Energy Consumption Within Manufacturing Systems. CIRP Journal of Manufacturing Science and Technology, 4(3), 258–64.
Shao, Z., Pi, D. & Shao, W. (2018). A Novel Discrete Water Wave Optimization Algorithm for Blocking Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times. Swarm and Evolutionary Computation, 40, 53–75.
Süer, G. A., Báez, E. & Czajkiewicz, Z. (1993). Minimizing the Number of Tardy Jobs in Identical Machine Scheduling. Computers & Industrial Engineering, 25(1-4), 243–46.
Takano, M. I. & Nagano, M. S. (2017). A Branch-and-Bound Method to Minimize the Makespan in a Permutation Flow Shop with Blocking and Setup Times. Cogent Engineering, 4(1), 1389638.
Takano, M. I. & Nagano, M. S. (2019). Evaluating the Performance of Constructive Heuristics for the Blocking Flow Shop Scheduling Problem with Setup Times. International Journal of Industrial Engineering Computations, 10(1), 37–50.
Tomazella, C. P. & Nagano, M. S. (2020). A Comprehensive Review of Branch-and-Bound Algorithms: Guidelines and Directions for Further Research on the Flowshop Scheduling Problem. Expert Systems with Applications, 158, 113556.
Wang, D.J., Yin, Y. & Liu, M. (2016). Bicriteria Scheduling Problems Involving Job Rejection, Controllable Processing Times and Rate-Modifying Activity. International Journal of Production Research, 54(12), 3691–3705.
Allahverdi, A. (2015). The Third Comprehensive Survey on Scheduling Problems with Setup Times/Costs. European Journal of Operational Research, 246(2), 345–78.
Allahverdi, A., Ng, C. T., Cheng, T. C. E. & Kovalyov, M. Y. (2008). A Survey of Scheduling Problems with Setup Times or Costs. European Journal of Operational Research, 187(3), 985–1032.
Bautista, J. & Pereira J. (2009). A Dynamic Programming Based Heuristic for the Assembly Line Balancing Problem. European Journal of Operational Research, 194(3), 787–94.
Bautista, J., Cano, A., Companys, R. & Ribas, I. (2012). Solving the Fm/ Block/ Cmax Problem Using Bounded Dynam-ic Programming. Engineering Applications of Artificial Intelligence, 25(6), 1235–45.
Fernandez-Viagas, V., Leisten, R. & Framinan, J. M. (2016). A Computational Evaluation of Constructive and Im-provement Heuristics for the Blocking Flow Shop to Minimise Total Flowtime. Expert Systems with Applications, 61, 290–301.
Gong, H., Tang, L. & Duin, C. W. (2010). A Two-Stage Flow Shop Scheduling Problem on a Batching Machine and a Discrete Machine with Blocking and Shared Setup Times. Computers & Operations Research, 37(5), 960–69.
Graham, R. L., Lawler, E. L., Lenstra, J. K. & Kan, A. H. G. R. (1979). Optimization and Approximation in Determinis-tic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics, 5, 287–326.
Gupta, J. N. D. & Stafford Jr., E. F. (2006). Flowshop Scheduling Research After Five Decades. European Journal of Operational Research, 169(3), 699–711.
Hon, K. K. B. (2005). Performance and Evaluation of Manufacturing Systems. CIRP Annals, 54(2), 139–54.
Ignall, E. & Schrage, L. (1965). Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Prob-lems. Operations Research, 13(3), 400–412.
Johnson, S. M. (1954). Optimal Two-and Three-Stage Production Schedules with Setup Times Included. Naval Research Logistics Quarterly, 1(1), 61–68.
Koren, Y., Heisel, U., Jovane, F., Moriwaki, T., Pritschow, G., Ulsoy, G. & Brussel H. V. (1999). Reconfigurable Manu-facturing Systems. CIRP Annals, 48(2), 527–40.
Lawler, E. L. & Moore, J. M. (1969). A Functional Equation and Its Application to Resource Allocation and Sequencing Problems. Management Science, 16(1), 77–84.
Lepuschitz, W., Zoitl, A., Vallée, M. & Merdan, M. (2010). Toward Self-Reconfiguration of Manufacturing Systems Using Automation Agents. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Re-views), 41(1), 52–69.
Li, S. S. & Yuan, J. J. (2020). Single-Machine Scheduling with Multi-Agents to Minimize Total Weighted Late Work. Journal of Scheduling, 23, 497–512.
Maccarthy, B. L. & Liu, J. (1993). Addressing the Gap in Scheduling Research: A Review of Optimization and Heuristic Methods in Production Scheduling. The International Journal of Production Research, 31(1), 59–79.
Mahalik, N. P. & Nambiar, A. N. (2010). Trends in Food Packaging and Manufacturing Systems and Technology. Trends in Food Science & Technology, 21(3), 117–28.
Martinez, S., Dauzère-Pérès, S., Gueret, C., Mati, Y. & Sauer., N. (2006). Complexity of Flowshop Scheduling Problems with a New Blocking Constraint. European Journal of Operational Research, 169(3), 855–64.
Merchan, A. F. & Maravelias, C. T. (2016). Preprocessing and Tightening Methods for Time-Indexed MIP Chemical Production Scheduling Models. Computers & Chemical Engineering, 84, 516–35.
Miyata, H. H. & Nagano, M. S. (2019). The Blocking Flow Shop Scheduling Problem: A Comprehensive and Conceptu-al Review. Expert Systems with Applications, 137, 130–56.
Moore, J. M. (1968). An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs. Manage-ment Science, 15(1), 102–9.
Mor, B. & Shapira., D. (2020). Regular Scheduling Measures on Proportionate Flowshop with Job Rejection. Computa-tional and Applied Mathematics, 39(2), 1–14.
Newton, M. A. H., Riahi, V., Su, K. & Sattar, A. (2019). Scheduling Blocking Flowshops with Setup Times via Con-straint Guided and Accelerated Local Search. Computers & Operations Research, 109, 64–76.
Ozolins, A. (2018). Bounded Dynamic Programming Algorithm for the Job Shop Problem with Sequence Dependent Setup Times. Operational Research, 20, 1701–1728.
Ozolins, A. (2019a). Dynamic Programming Approach for Solving the Open Shop Problem. Central European Journal of Operations Research, 29, 291–306.
Ozolins, A. (2019b). Improved Bounded Dynamic Programming Algorithm for Solving the Blocking Flow Shop Prob-lem. Central European Journal of Operations Research, 27(1), 15–38.
Pinedo, M. (2012). Scheduling. Springer.
Potts, C. N. & Wassenhove, L. N. V. (1985). A Branch and Bound Algorithm for the Total Weighted Tardiness Problem. Operations Research, 33(2), 363–77.
Ribas, I., Companys, R. & Tort-Martorell, X. (2015). An Efficient Discrete Artificial Bee Colony Algorithm for the Blocking Flow Shop Problem with Total Flowtime Minimization. Expert Systems with Applications, 42(15-16), 6155–67.
Ronconi, D. P. (2005). A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking. Annals of Operations Research, 138(1), 53–65.
Seow, Y. & Rahimifard, S. (2011). A Framework for Modelling Energy Consumption Within Manufacturing Systems. CIRP Journal of Manufacturing Science and Technology, 4(3), 258–64.
Shao, Z., Pi, D. & Shao, W. (2018). A Novel Discrete Water Wave Optimization Algorithm for Blocking Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times. Swarm and Evolutionary Computation, 40, 53–75.
Süer, G. A., Báez, E. & Czajkiewicz, Z. (1993). Minimizing the Number of Tardy Jobs in Identical Machine Scheduling. Computers & Industrial Engineering, 25(1-4), 243–46.
Takano, M. I. & Nagano, M. S. (2017). A Branch-and-Bound Method to Minimize the Makespan in a Permutation Flow Shop with Blocking and Setup Times. Cogent Engineering, 4(1), 1389638.
Takano, M. I. & Nagano, M. S. (2019). Evaluating the Performance of Constructive Heuristics for the Blocking Flow Shop Scheduling Problem with Setup Times. International Journal of Industrial Engineering Computations, 10(1), 37–50.
Tomazella, C. P. & Nagano, M. S. (2020). A Comprehensive Review of Branch-and-Bound Algorithms: Guidelines and Directions for Further Research on the Flowshop Scheduling Problem. Expert Systems with Applications, 158, 113556.
Wang, D.J., Yin, Y. & Liu, M. (2016). Bicriteria Scheduling Problems Involving Job Rejection, Controllable Processing Times and Rate-Modifying Activity. International Journal of Production Research, 54(12), 3691–3705.