Sign in
Back
A new lower bound for minimising the total completion time in a two-machine flow shop under release dates
Conference proceeding

A new lower bound for minimising the total completion time in a two-machine flow shop under release dates

Sabrine Chalghoumi, Mehdi Mrad, Talel Ladhari and IEEE
2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), pp.1-4
International Conference on Modeling Simulation and Applied Optimization
01/01/2013
DOI: https://doi.org/10.1109/ICMSAO.2013.6552646

Abstract

Computer Science Computer Science, Information Systems Computer Science, Interdisciplinary Applications Engineering Engineering, Electrical & Electronic Science & Technology Technology
In this paper, we describe a mixed integer linear programming (MILP) formulation used to model the two-machine flow shop scheduling problem subject to release dates. This MILP formulation is based on the Positional and Assignment Variables(PAVF). The results of the linear relaxation bound derived from the later mathematical formulation shows the performance of this new bound compared with the best known lower bound recently presented for the studied problem.

Metrics

1 Record Views

Details