//-->
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
Gmys, Jan, (2020)
Design and analysis of evolutionary algorithms for the no-wait flow-shop scheduling problem
Czogalla, Jens, (2009)
A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
Defersha, Fantahun M., (2015)
Introduction
Coble, Lana Kay, (2018)
Chapter 8 Did Your Planning Meet the Desired Deadline?
Chapter 6 Contingency Planning