Yannick Frein

Learn More
We consider the problem of minimizing the size of a family of sets G such that every subset of {1, . . . , n} can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world application aiming at the diversity of industrial production. At the same time, the question of finding the(More)
Analytical methods have been proposed in the literature for performance evaluation of kanban control systems. Among them, the method presented in [Di Mascolo et al. 96] appears to be of special interest since it can handle manufacturing stages consisting of any number of machines and it is fairly accurate. In this paper, we present a new way of deriving the(More)
In our research, we study the case of a pulp and paper producer who decides to establish a partnership with one buyer. Using two different types of relationship, namely a traditional system without any collaboration scheme and Collaborative Planning, Forecasting and Replenishment, we develop decision models describing the producer and the buyer planning(More)