Title: Two-machine chain-reentrant flow shop with the no-wait constraint

Authors: Karim Amrouche; Mourad Boudhar; Nazim Sami

Addresses: University of Algiers 3, 2 Street Ahmed Oueked, Dely Brahim, Algiers, Algeria; RECITS Laboratory, Faculty of Mathematics, USTHB University, BP 32 Bab-Ezzouar, El-Alia 16111, Algiers, Algeria ' RECITS Laboratory, Faculty of Mathematics, USTHB University, BP 32 Bab-Ezzouar, El-Alia 16111, Algiers, Algeria ' RECITS Laboratory, Faculty of Mathematics, USTHB University, BP 32 Bab-Ezzouar, El-Alia 16111, Algiers, Algeria

Abstract: This paper addresses the chain-reentrant flow shop scheduling problem with two machines and n non-preemptive jobs in the presence of the no-wait constraint; we assume that each job passes from the first machine to the second and returns back to the first machine. The objective is to minimise the makespan. The general problem is NP-hard in the strong sense. Based on a dynamic programming algorithm, we prove that the problem is polynomially solvable when the execution order of the jobs through the machines is a fixed permutation. For the resolution of the general problem, we propose a linear mathematical model, local search heuristics, a simulated annealing metaheuristic and lower bounds with numerical experiments. [Received: 8 February 2019; Revised: 19 June 2019; Revised: 26 August 2019; Revised: 8 October 2019; Revised: 9 November 2019; Accepted: 11 November 2019]

Keywords: chain-reentrant flow shop; no-wait constraint; dynamic programming; mathematical formulation; heuristics; simulated annealing.

DOI: 10.1504/EJIE.2020.108577

European Journal of Industrial Engineering, 2020 Vol.14 No.4, pp.573 - 597

Published online: 20 Jul 2020 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article