Title: Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicity

Authors: Djedjiga Ouiddir; Mourad Boudhar; Karima Bouibede-Hocine

Addresses: RECITS Laboratory, Faculty of Mathematics, USTHB University, BP 32, El-Alia 16111, Algiers, Algeria ' RECITS Laboratory, Faculty of Mathematics, USTHB University, BP 32, El-Alia 16111, Algiers, Algeria ' RECITS Laboratory, Faculty of Mathematics, USTHB University, BP 32, El-Alia 16111, Algiers, Algeria; Department of Computer Science, USTHB University, BP 32, El-Alia 16111, Algiers, Algeria

Abstract: This work addresses a just-in-time (JiT) scheduling problem on two-machine flow shop. We consider the case where each order (job) is composed of several pieces with sequence-dependent setup times. This scheduling problem involves the reducing waste, inventory costs and making goods available as and when needed. Here, the jobs incur either penalties or storage costs if they are not completed within their specific due dates. The aim is to obtain a sequence which minimises two criteria: the total weighted earliness and the total weighted tardiness. For the resolution of this problem, we propose a linear mathematical model, three heuristics and two meta-heuristics, the fast and elitist multi-objective genetic algorithm (NSGA-II) and the multi-objective tabu search algorithm (MOTS). The computational experiments, presented and discussed on randomly generated instances, are showed the effectiveness of the proposed model and NSGA-II.

Keywords: flow shop; just-in-time; JiT; pieces multiplicity; multi-criteria; mixed integer linear programming; MILP; meta-heuristics.

DOI: 10.1504/IJMOR.2023.130115

International Journal of Mathematics in Operational Research, 2023 Vol.24 No.4, pp.510 - 536

Received: 10 Dec 2021
Accepted: 16 Apr 2022
Published online: 05 Apr 2023 *

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