| Article ID: | iaor1996770 |
| Country: | Netherlands |
| Volume: | 61 |
| Issue: | 1/2 |
| Start Page Number: | 215 |
| End Page Number: | 218 |
| Publication Date: | Aug 1992 |
| Journal: | European Journal of Operational Research |
| Authors: | Bausch Raymond |
| Keywords: | manufacturing industries, decision theory: multiple criteria, programming: branch and bound |
This paper is concerned with multicriteria scheduling problems encountered by the author in the context of steel industry management. The mathematical model of this broad class of applications is that of finding an ordering of objects that minimises a list of penalty functions considered in a lexicographical way. An algorithm based on branch-and-bound techniques is described. Experience with this algorithm on daily production scheduling at ARBED Luxembourg is reported.