Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates

Abstract

We consider the problem of minimizing the sum of completion times in a two‐machine permutation flowshop subject to release dates. New procedures are proposed for effectively bounding the completion time of a given job that is processed at a given position. New assignment‐based lower bounds are derived as well as an enhanced mathematical programming formulation. Our computational analysis shows a consistent tightness of the proposed lower bounds and a high outperformance of the enhanced mathematical formulation with respect to the classical one.

A Monte Carlo simulation approach to the gap-time relationship in solving scheduling problem

“…Despite these challenges, researchers and practitioners continue to develop new methods and algorithms to reduce the required computation time and improve the efficiency of methods in solving the scheduling IP problems. Some of the most used solution methods include branch-and-bound algorithms, linear programming techniques, and heuristic methods (Belotti, 2013;Gharbi et al, 2019;Liu, 2023). Required computational time, then, is a crucial factor in determining the efficiency of various solution processes for scheduling IP problems.…”

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

“…Wan and Yen (2002), Behnamian et al (2009), Arroyo et al (2011), Ribeiro et al (2010), Rosa et al (2017), and Jing et al (2020) addressed theoretically and algorithmically the problem of minimizing earliness and tardiness scheduling with due windows. However, they did not consider the release date, one of the indispensable features in practice (Chou et al, 2005;Mrad et al, 2019). To the best of our knowledge, only Yoo and Martin-Vega (2001) and Janiak et al (2009) examined the JIT scheduling problem with due windows and release dates.…”

“…(2020) addressed theoretically and algorithmically the problem of minimizing earliness and tardiness scheduling with due windows. However, they did not consider the release date, one of the indispensable features in practice (Chou et al., 2005; Mrad et al., 2019). To the best of our knowledge, only Yoo and Martin‐Vega (2001) and Janiak et al.…”