MACHINE ALLOCATION PROBLEMS IN MANUFACTURING NETWORKS

被引：31

作者：

BOXMA, OJ

KAN, AHG

VANVLIET, M

机构：

[1] TILBURG UNIV,FAC ECON,5000 LE TILBURG,NETHERLANDS

[2] ERASMUS UNIV,INST ECONOMETR,3000 DR ROTTERDAM,NETHERLANDS

[3] ERASMUS UNIV,INST TINBERGEN,3000 DR ROTTERDAM,NETHERLANDS

[4] AKB CONSULTANTS,ROTTERDAM,NETHERLANDS

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1990年 / 45卷 / 01期

关键词：

Combinatorial optimization; flexible manufacturing systems; manufacturing networks; marginal analysis; queueing network; server allocation;

D O I：

10.1016/0377-2217(90)90155-5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper we discuss two server (machine) allocation problems that occur in manufacturing networks. The manufacturing network is modelled as an open network of queues. The server allocation problems are solved by means of a marginal analysis scheme. We show that for the first problem our algorithm generates undominated allocations. Furthermore, the algorithm provides us with bounds to check how close the allocation generated is to the optimal allocation. In the second problem the algorithm presented generates optimal allocations within time bounded by a polynomial function in the size of the network. © 1990.

引用

页码：47 / 54

页数：8

共 19 条

[1] MULTIPRODUCT QUEUING-NETWORKS WITH DETERMINISTIC ROUTING - DECOMPOSITION APPROACH AND THE NOTION OF INTERFERENCE [J].