Article ID: | iaor20021807 |
Country: | Netherlands |
Volume: | 135 |
Issue: | 1 |
Start Page Number: | 42 |
End Page Number: | 49 |
Publication Date: | Nov 2001 |
Journal: | European Journal of Operational Research |
Authors: | Proust C., Billaut J.-C., T'kindt V. |
Keywords: | scheduling, programming: linear |
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.