Planning the routing mix in FASs to minimize total transportation time

被引:14
作者
Agnetis, A
机构
[1] Università di Roma La Sapienza, Dipartimento di Informatica e Sistemstica, 00185 Roma
来源
INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS | 1996年 / 8卷 / 02期
关键词
column generation; flow management; linear programming; routing; workload balancing;
D O I
10.1007/BF00394501
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The routing mix problem in flexible assembly systems is considered. The problem consists of assigning the operations for each part to the machines, with the two objectives of balancing the machine workloads and minimizing the burden of the transportation system. These two objectives are sometimes conflicting, since the latter tends to support assigning operations to the same machine(s) as much as possible, and this may be bad for workload balancing. A linear programming problem is presented that, given a constraint on the workload of each machine, finds one solution that minimizes the overall time spent moving the parts from one machine to another. Since such a linear program may have an exponential number of variables, an efficient column generation technique to solve the problem is devised. The efficiency of the method is validated by experiments on a large number of random problems.
引用
收藏
页码:131 / 157
页数:27
相关论文
共 37 条