We present an exact branch-and-bound algorithm for the two-stage hybrid flow shop problem with multiple identical machines in each stage. The objective is to schedule a set of jobs so as to minimize the makespan. This is the first exact procedure which has been specifically designed for this...

We present an exact branch-and-bound algorithm for the two-stage hybrid flow shop problem with multiple identical machines in each stage. The objective is to schedule a set of jobs so as to minimize the makespan. This is the first exact procedure which has been specifically designed for this...

We investigate the single machine scheduling problem with job release dates and due dates, and multiple planned unavailability time periods. This problem arises in the context of machine scheduling with planned preventive maintenance and might be viewed as a generalisation of several fundamental...

La supply chain apparaît plus vulnérable et fragile dans un contexte marqué par une grande pression concurrentielle, une demande volatile, une tendance vers les économies d'échelle et l'externalisation. La gestion de risque représente ainsi un enjeu incontournable et essentiel pour la...