Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags

Imen Hamdi, Taïcir Loukil. Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags. Optimization Letters, 9(3):465-482, 2015. [doi]

@article{HamdiL15,
  title = {Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags},
  author = {Imen Hamdi and Taïcir Loukil},
  year = {2015},
  doi = {10.1007/s11590-014-0761-7},
  url = {http://dx.doi.org/10.1007/s11590-014-0761-7},
  researchr = {https://researchr.org/publication/HamdiL15},
  cites = {0},
  citedby = {0},
  journal = {Optimization Letters},
  volume = {9},
  number = {3},
  pages = {465-482},
}