We consider a competitive scheduling setting with arbitrary number of agents each having the option to utilize two parallel resources to satisfy its demand: (i) an in-house resource dedicated to process only the tasks of each specific agent, and (ii) a flexible resource capable of processing all...

Introduction -- The Two-Machine Flow Shop -- Transfer Lags in the Flow Shop -- The m-Machine Flow Shop -- The Machine Flow Shop -- The Hybrid Flow Shop -- The No-Wait Flow Shop -- Blocking or Limited Buffers in Flow Shops -- Flexible Flow Shops -- Reentrant Flow Shops -- The Robust Flow Shops --...

Although several monographs and edited volumes have discussed scheduling in general, most of these works survey the field by contributing a single chapter to production systems like flow shops. Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications is solely dedicated to...