Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights

J. A. Alejandro-Soto, Carlos Segura, Joel Antonio Trejo-Sanchez

In this work, we use the matrix formulation of the Permutation Flowshop Scheduling Problem with makespan minimization to derive an upper bound and a general framework for obtaining…