Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags

Imen Hamdi, Taïcir Loukil. Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags. In International Conference on Control, Decision and Information Technologies, CoDIT 2014, Metz, France, November 3-5, 2014. pages 42-47, IEEE, 2014. [doi]

@inproceedings{HamdiL14,
  title = {Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags},
  author = {Imen Hamdi and Taïcir Loukil},
  year = {2014},
  doi = {10.1109/CoDIT.2014.6996865},
  url = {http://dx.doi.org/10.1109/CoDIT.2014.6996865},
  researchr = {https://researchr.org/publication/HamdiL14},
  cites = {0},
  citedby = {0},
  pages = {42-47},
  booktitle = {International Conference on Control, Decision and Information Technologies, CoDIT 2014, Metz, France, November 3-5, 2014},
  publisher = {IEEE},
  isbn = {978-1-4799-6773-5},
}