Premium
Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
Author(s) -
Mrad Mehdi,
Chalghoumi Sabrine,
Ladhari Talel,
Gharbi Anis
Publication year - 2019
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12421
Subject(s) - bounding overwatch , permutation (music) , minification , mathematical optimization , computer science , upper and lower bounds , position (finance) , mathematics , algorithm , artificial intelligence , mathematical analysis , physics , finance , acoustics , economics
We consider the problem of minimizing the sum of completion times in a two‐machine permutation flowshop subject to release dates. New procedures are proposed for effectively bounding the completion time of a given job that is processed at a given position. New assignment‐based lower bounds are derived as well as an enhanced mathematical programming formulation. Our computational analysis shows a consistent tightness of the proposed lower bounds and a high outperformance of the enhanced mathematical formulation with respect to the classical one.