Minimizing makespan in flowshop with time lags
Discrete Mathematics
2019-05-01 v1
Abstract
We consider the problem of minimizing the makespan in a flowshop involving maximal and minimal time lags. Time lag constraints generalize the classical precedence constraints between operations. We assume that such constraints are only defined between operations of the same job. We propose a solution method and present several extensions.
Cite
@article{arxiv.cs/0507016,
title = {Minimizing makespan in flowshop with time lags},
author = {Julien Fondrevelle and Ammar Oulamara and Marie-Claude Portmann},
journal= {arXiv preprint arXiv:cs/0507016},
year = {2019}
}
Comments
2 pages. Also available at http://hal.inria.fr/inria-00000149