An upper bound for the inter-exit time of two jobs in an m-machine flow shop

This paper addresses the class of permutation flow shop scheduling where jobs, after their completion, must be grouped in batches. This is a common scheme in industrial environments, where products undergo multiple process steps in different shops and, when completed, must be transported to customers or the next production step. A new optimisation criterion is used, the inter-exit time, i.e., the difference between the completion times of two jobs. An upper bound is proposed and demonstrated for a general permutation flow shop with m machines

Warehouse Operations Revisted: Novel Challenges and Methods

Vis, I.F.A. [Promotor]Boter, J. [Promotor

A branch-and-bound approach to schedule a no-wait flow shop to minimize the CVaR of the residual work content

The aerospace industry ranks among the largest manufacturing industries in the world facing a significant growing phase as well as an increased competition. This paper addresses the scheduling of a set of jobs in a paced assembly line in presence of uncertainty affecting the availability of production resources, stemming from the assembly process in the aircraft manufacturing industry. The production problem is modeled as a no-wait paced permutation flow shop and solved providing a robust scheduling solution minimizing the conditional value-at-risk (CVaR) of the residual work content, i.e., the amount of workload that cannot be completed during the cycle time in the stations, due to a lack of available resources. A branch-and-bound approach is developed and applied to randomly generated instances as well as to an industrial problem related to the production of aircrafts