Short term planning for cyclic scheduling: A new approach

In this paper, we study the problem of producing a projected economic quantity in a planning phase. We perform the production during one or more cyclic steady states while respecting pre-established constraints. During this work, we provide a non-linear mathematical formula of the problem that use different integer variables and aims to respect nonlinear constraints. We choose to optimize the makespan value as the main criteria. In order to linearize this problem, we generate a data set that take into account the entire feasible cyclic production horizons. Then, we elaborate an enumerative approach that aims to generate the best number of steady states of each cycle using the simplex algorithm for each cyclic feasible combination. In order to evaluate our work, we compare our approach with the work of Chaieb et al. [2]. A the end, the experiments validate our proposed approach and show that by using it we will have satisfactory results.