Greedy algorithms for planning the production of a real shampoo industry
Résumé
We present in this work a scheduling problem arising in a real shampoo industry. We model this problem as a three stage Hybrid Flowshop with a common server of setups. The objective is to minimize the number of cleanings of the making resources. Here, we present some experimental results of the first heuristics that we have developed to solve this problem.