The Lagrangean Relaxation for the Flow Shop Scheduling Problem with Precedence Constraints, Release Dates and Delivery Times

Abstract

This work aims to present a methodology to support a company in the automotive business on scheduling the jobs on its final processes. These processes are: (i) checking the final product and (ii) loading the dispatch trucks. These activities are usually found in the outbound area of any manufacturing company. The problem faced is defined as the flow shop problem with precedence constraints, release dates, and delivery times. The major objective is to minimize the latest date a client receives its products. We present a time-indexed integer mathematical model to compute feasible solutions for the presented problem. Moreover, we take advantage of the Lagrangean Relaxation procedure to compute valid lower and upper bounds. The experiments were held based on the company’s premises. As a conclusion, the results showed that the methodology proposed was able to compute feasible solutions for all the instances tested. Also, the Lagrangean Relaxation approach was able to calculate better bounds in a shorter computational time than the Mathematical problem for the more complicated instances.

The in‐house logistics routing problem

“…Consequently, the in-house activities are in charge of storing the received materials in the WHS, executing the picking of these materials, and proceeding with the supply of the placed orders in the assembling lines. For materials handling related works see Mason et al (2003), Poon et al (2009), Klug (2013), Atieh et al (2016), Zhou and Peng (2017), Ribino et al (2018), and Fabri et al (2019).…”

Internal logistics flow simulation: A case study in automotive industry

“…Works that tackle issues related to Production Flow are: (Ĉujan , 2016;Ruiz-Torres & Nakatani, 1998;Seebacher, Winkler, & Oberegger, 2015). Also, works that center their approach to the automotive sector and the production flow are: (Fabri, Ramalhinho, de Souza, & Ravetti, 2019;Faget, Eriksson, & Herrmann, 2005;Ludavicius & Ali, 2014;Michalos, Makris, Papakostas, Mourtzis, & Chryssolouris, 2010;Patchong, Lemoine, & Kern, 2003;Roman-Verdugo, 2014).…”

“…Production Flow (Ĉujan , 2016;Fabri et al, 2019;Faget et al, 2005), (Ludavicius & Ali, 2014;Michalos , 2010) (Patchong et al, 2003;Seebacher et al , 2015), (Roman-Verdugo , 2014;Ruiz-Torres & Nakatani , 1998), Layout Evaluation (Martínez-Barberá & Herrero-Pérez , 2010, (Horta et al, 2016;Wang & Chang , 2015), Material Handling (Atieh et al , 2016;Caridade et al , 2017), Flow (Gagliardi at al., 2007;Higgins et al, 2019;Klug , 2013), (Mason et al , 2003;Poon et al , 2009), (Ribino et al, 2018;Zhou & Peng , 2017) Routing Strategy (Lima & Ramalhinho, 2017;Mehami et al , 2018), (Vavrík et al , 2017) Table 1. Related work.…”