A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions

Abstract

Abstract. In this article, we propose a hybrid procedure based on bounded dynamic programming (BDP) assisted by linear programming (LP) to solve the mixed-model sequencing problem with workload minimization (MMSP-W) with serial workstations, free interruption of the operations and with production mix restrictions. We performed a computational experiment with 23 instances related to a case study of the Nissan powertrain plant located in Barcelona. The results of our proposal are compared with those obtained by Mixed Integer Linear Programming (MILP).

A GRASP algorithm for Quota sequences with minimum work overload and forced interruption of operations in a mixed-product assembly line

“…The computational experience that we propose is focused on analyzing the behavior of the GRASP algorithm proposed in this paper, compared to two other procedures, in terms of the quality of the solutions and the CPU times; these procedures are (1) BDP-1 [6] and (2) GRASP-1 [7]. As in [8], [9] and [10], the analysis is conducted on a case study of the Nissan plant in Barcelona: an assembly line of 9 types of engines grouped into 3 families (SUVs -Sport Utility Vehicle-, vans and trucks). Figure 1 shows an engine type M1 that belongs to the Sport Utility Vehicle family.…”

“…without completing the operation ( [6], [7]). The free interruption occurs when the incomplete product passes to the next station before reaching the limit of the temporary window of the emitting station ( [8], [9], [10]). Obviously, the operation is interrupted whenever the limit established by the temporary window !…”

Free and regular mixed-model sequences by a linear program-assisted hybrid algorithm GRASP-LP

“…Particularly, a GRASP algorithm (Greedy Randomized Adaptive Search Procedure) to obtain sequences with minimum work overload and a linear program to include regularity and free interruption of operations are designed and implemented in this paper. Besides, in order to assess the performance of the proposed hybrid procedure the results are compared with those obtained in previous researches that are the state of art of the problem under study: the Bounded Dynamic Programming with linear programing assistance (BDP-2) [10] and with Mixed Integer Linear Programming (MILP) [9]. Accordingly, the paper is structured as follows: the MMSP-W/pmr/free is formulated in section 2; section 3 describes the GRASP algorithm and the linear program that assists GRASP and improves the solution given by the first; the case study is presented in section 4, showing the results given by the three assessed procedures; finally, the conclusions are collected in section 5.…”

“…By using the LP-W, the GRASP-LP hybrid procedure is place on a equal footing to compete on the problem resolution with other procedures from the literature: MILP [9] y BDP-2 [10].…”

“…We take into account the two versions of this algorithm according to the pseudo-dominances of vertices, the 2/1 and the 2/2, (see [10]). − MILP: 4 ∪ 3_!…”