Just in time multicriteria scheduling problem in two-machine flow shop

Abstract

In this paper, we are interested in the just in time multicriteria two-machine flow shop scheduling problem. Our aim is to highlight basic scheduling objective functions and the notion of just in time in production management. A cost function is defined for each job, taking into account additional constraints. We also position our problem with regard to what exists in the literature. First, we provide a brief literature review concerning the bi-criteria flow shop scheduling problem (FSP). Afterwards, we propose a mixed integer linear programming (MILP) formulation and two heuristics to solve the problem along with an experimental study we conducted in order to test their performance.