Minimizing makespan in flowshop with time lags

TL;DR

This paper addresses the complex problem of minimizing makespan in flowshops with time lag constraints, proposing a new solution method and exploring various extensions to handle these generalized precedence constraints.

Contribution

It introduces a novel solution approach for flowshop scheduling with time lags, extending classical models to include maximal and minimal lag constraints.

Findings

Proposed a new method for flowshop scheduling with time lags

Extended classical models to incorporate time lag constraints

Demonstrated effectiveness of the approach through extensions

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.