WEKO3
アイテム
Algorithms for unbounded and varied capacitated lot-sizing problems with outsourcing
https://edo.repo.nii.ac.jp/records/666
https://edo.repo.nii.ac.jp/records/6668608d009-1e4d-45b9-8cb9-4ab64cbe5d63
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 紀要論文(ELS) / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2016-03-15 | |||||
タイトル | ||||||
タイトル | Algorithms for unbounded and varied capacitated lot-sizing problems with outsourcing | |||||
言語 | en | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | Unbounded and period varying capacitated lot-sizing models | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | Outsourcing | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | Dynamic programming | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
ページ属性 | ||||||
内容記述タイプ | Other | |||||
内容記述 | P(論文) | |||||
記事種別(日) | ||||||
値 | 論文 | |||||
著者名(日) |
ザン ピン
× ザン ピン |
|||||
著者名(英) |
Ping Zhan
× Ping Zhan |
|||||
抄録(英) | ||||||
内容記述タイプ | Other | |||||
内容記述 | Lot-sizing problems have been extensively researched for more than half century.There are relative small number of papers on lot-sizing models with outsourcing, despite its important applications in operations research. Recently several papers related to out-sourcing models are published.When there is no bound on production capacity, linear algorithm( totally square) is possible. Period varying capacitated lot-sizing model is known as NP-hard even outsourcing is not allowed. In this manuscript, we treat these two extreme cases, we give a efficient algorithm for former case, and propose a pseudo-polynomial scheme for period varying production capacities. | |||||
雑誌書誌ID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA12560733 | |||||
書誌情報 |
江戸川大学紀要 en : Bulletin of Edogawa University 巻 26, 発行日 2016-03-15 |