A MULTICRITERIA SCHEDULING TOOL USING A BRANCH-AND-BOUND ALGORITHM

被引：4

作者：

BAUSCH, R

机构：

[1] ARBED Information Systems S.A., Luxembourg, 19, Ave. la Liberte

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1992年 / 61卷 / 1-2期

关键词：

PLANNING; SINGLE-MACHINE SCHEDULING; MANUFACTURING INDUSTRIES; MULTIPLE CRITERIA; BRANCH-AND-BOUND;

D O I：

10.1016/0377-2217(92)90282-E

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：215 / 218

页数：4