Title :
A new lower bound for minimising the total completion time in a two-machine flow shop under release dates
Author :
Chalghoumi, Sabrine ; Mrad, Mehdi ; Ladhari, Talel
Author_Institution :
Ecole Super. des Sci. Economiques et Commerciales, Tunis, Tunisia
Abstract :
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.
Keywords :
flow shop scheduling; integer programming; linear programming; minimisation; MILP formulation; PAVF; linear relaxation bound; lower bound; mathematical formulation; mixed integer linear programming formulation; positional and assignment variables; release dates; total completion time minimisation; two-machine flow shop scheduling problem; Equations; Genetics; Job shop scheduling; Mathematical model; Measurement uncertainty; Optimal scheduling; Upper bound;
Conference_Titel :
Modeling, Simulation and Applied Optimization (ICMSAO), 2013 5th International Conference on
Conference_Location :
Hammamet
Print_ISBN :
978-1-4673-5812-5
DOI :
10.1109/ICMSAO.2013.6552646
