Material compatibility constraints for make-to-order production planning

被引：5

作者：

Ball, MO ^{[1
]}

Chen, CY

Zhao, ZY

机构：

[1] Univ Maryland, RH Smith Sch Business, College Pk, MD 20742 USA

[2] Univ Maryland, Syst Res Inst, College Pk, MD 20742 USA

[3] George Mason Univ, Sch Management, Fairfax, VA 22030 USA

来源：

OPERATIONS RESEARCH LETTERS | 2003年 / 31卷 / 06期

基金：

美国国家科学基金会;

关键词：

production planning; integer programming; matching;

D O I：

10.1016/S0167-6377(03)00045-2

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper defines a set of material compatibility constraints for use in order promising mixed integer programs. The constraints always represent a necessary condition for compatibility and, in certain cases, are both necessary and sufficient. The underlying analysis represents incompatibilities using bipartite graphs and applies results from the perfectly matchable subgraph polytope. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：420 / 428

页数：9