Sign in
Back
AN EXACT ALGORITHM MINIMIZING THE MAKESPAN FOR THE TWO-MACHINE FLOWSHOP SCHEDULING UNDER RELEASE DATES AND BLOCKING CONSTRAINTS
Journal article   Peer reviewed

AN EXACT ALGORITHM MINIMIZING THE MAKESPAN FOR THE TWO-MACHINE FLOWSHOP SCHEDULING UNDER RELEASE DATES AND BLOCKING CONSTRAINTS

Hajer Amdouni, Mahdi Jemmali, Mehdi Mrad and Talel Ladhari
International journal of industrial engineering, Vol.28(6), pp.631-643
15/12/2021
DOI: https://doi.org/10.23055/ijietap.2021.28.6.6839

Abstract

Engineering Engineering, Industrial Engineering, Manufacturing Science & Technology Technology
This paper describes the problem of two-machine permutation flowshop scheduling with release dates where blocking constraint is authorized. The objective is the minimization of the makespan. This problem is proved as an NP-hard problem. Four lower bounds were developed in this paper to test experimental results with different classes. An optimal solution is also proposed based on the mathematical formulation and solved using the Cplex program.

Metrics

1 Record Views

Details