AN EFFICIENT ZERO-ONE FORMULATION OF THE MULTILEVEL LOT-SIZING PROBLEM

被引：18
|
作者：
MCKNEW, MA
SAYDAM, C
COLEMAN, BJ
机构：
[1] UNIV N CAROLINA,DEPT MIS OM,CHARLOTTE,NC 28223
[2] UNIV N FLORIDA,DEPT MANAGEMENT MKT & LOGIST,JACKSONVILLE,FL 32216
来源：
DECISION SCIENCES | 1991年 / 22卷 / 02期
关键词：
AREAS; LINEAR PROGRAMMING; MATERIAL REQUIREMENTS PLANNING; AND PRODUCTION/OPERATIONS MANAGEMENT;
D O I：
10.1111/j.1540-5915.1991.tb00347.x
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper presents a zero‐one linear formulation of the multilevel lot‐sizing problem for materials requirement planning systems without capacity constraints. The model is an efficient statement of the problem and has a structure that is particularly convenient for research work. In addition, it is demonstrated that the relaxed linear programming solution to this formulation will always be integer. The results of a rather large computational history are reported along with a variable reduction methodology that allows for the solution of reasonably sized research problems. Copyright © 1991, Wiley Blackwell. All rights reserved
引用
收藏
页码：280 / 295
页数：16
相关论文
共 50 条
12345