Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
This paper deals with the resolution of a bicriteria scheduling problem connected with the glass bottles production. The shop is made up of unrelated parallel machines and the aim is to compute a schedule of orders that maximizes the total margin and that minimizes the difference in machines workload. An algorithm to compute the set of all strict Pareto optima is offered and later extended into an interactive algorithm.
scheduling multicriteria analysis linear programming a posteriori algorithm