THE DISCRETE LOT-SIZING AND SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP COSTS

被引：68

作者：

FLEISCHMANN, B

机构：

[1] Universität Augsburg, 86159 Augsburg

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 75卷 / 02期

关键词：

MANUFACTURING; LOT-SIZING; SCHEDULING; LAGRANGE MULTIPLIERS;

D O I：

10.1016/0377-2217(94)90083-3

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the problem of scheduling several products on a single machine so as to meet the known dynamic demand and to minimize the sum of inventory costs and sequence-dependent setup costs. The planning interval is subdivided into many short periods, e.g. shifts or days, and any lot must last one or several full periods. We formulate this problem as a travelling salesman problem with time windows and present a new procedure for determining lower bounds using Lagrangean relaxation as well as a heuristic. Computational results for problems with up to 10 products and 150 periods are reported.

引用

页码：395 / 404

页数：10

共 17 条

[1]

DESROCHERS M, 1988, INFOR, V26, P191

[2]

Desrochers M., 1988, VEHICLE ROUTING METH, V16, P65

[3] LAGRANGIAN-RELAXATION METHODS FOR SOLVING THE MINIMUM FLEET SIZE MULTIPLE TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS [J].