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.
https://hal.inria.fr/inria-00000149 Contributor : Julien FondrevelleConnect in order to contact the contributor Submitted on : Wednesday, July 6, 2005 - 3:57:05 PM Last modification on : Friday, February 4, 2022 - 3:21:47 AM Long-term archiving on: : Thursday, April 1, 2010 - 9:54:14 PM
Julien Fondrevelle, Ammar Oulamara, Marie-Claude Portmann. Minimizing makespan in flowshop with time lags. Models and Algorithms for Planning and Scheduling Problems - MAPSP'2005, Jun 2005, Sienne/Italie. ⟨inria-00000149⟩