首页   按字顺浏览 期刊浏览 卷期浏览 A Branch and Bound Algorithm for a Single-Item Multi-Source Dynamic Lot Sizing Problem ...
A Branch and Bound Algorithm for a Single-Item Multi-Source Dynamic Lot Sizing Problem with Capacity Constraints

 

作者: S.Selcuk Erenguc,   Suleyman Tufekci,  

 

期刊: IIE Transactions  （Taylor Available online 1987）
卷期: Volume 19, issue 1  

页码: 73-80

 

ISSN:0740-817X

 

年代: 1987

 

DOI:10.1080/07408178708975372

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

In this paper we present a branch and bound algorithm for solving a single-item, multi-source dynamic lot sizing problem with time-varying capacity constraints. We consider a single-item production (and/or procurement) environment where there are multiple sources of supply with different cost structures. Computational results are presented.

 

点击下载:  PDF (389KB)



返 回