The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness

DOI10.1504/IJOR.2017.10000663zbMath1362.90190OpenAlexW2531142354MaRDI QIDQ2627801

Imen Hamdi, Taïcir Loukil

Publication date: 31 May 2017

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2017.10000663

zbMATH Keywords

upper boundsearlinesslower boundstardinessflowshop schedulingmathematical formulationspermutation flowshopsexact time lags

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Coupled task scheduling with exact delays: literature review and models

Uses Software

• CPLEX

This page was built for publication: The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness