Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints

TL;DR

This paper addresses a complex flow shop scheduling problem with inter-stage flexibility and blocking constraints, proposing heuristic algorithms and mathematical models to improve production efficiency in manufacturing.

Contribution

It introduces new heuristic and matheuristic algorithms for a complex NP-hard scheduling problem with inter-stage flexibility and blocking constraints.

Findings

Heuristic algorithms outperform traditional methods on real-world instances.

Polynomial-time solutions found for specific special cases.

Matheuristics effectively balance solution quality and computational time.

Abstract

We investigate a scheduling problem arising from a material handling and processing problem in a production line of an Austrian company building prefabricated house walls. The addressed problem is a permutation flow shop with blocking constraints in which the machine of at least one stage can process a number operations of two other stages in the system. This situation is usually referred to as multi-task or inter-stage flexibility. The problem is in general NP-hard, but we derive a number of special cases that can be solved in polynomial time. For the general case, we present a variety of heuristic algorithms, with a focus on matheuristics that are grounded in two different mixed-integer linear programming (MIP) formulations of the problem. These matheuristics leverage the strengths of exact optimization techniques while introducing flexibility to address limits on computation time. To assess the performance of the proposed approaches, we conduct an extensive computational study on randomly generated test cases based on real-world instances.