Complexity of a dynamic lot-production planning problem formulated by a 0-1 pure integer programming

Saved in:
Bibliographic Details
Published inNihon Kikai Gakkai rombunshuu. C hen
Format Journal Article
LanguageJapanese
Online AccessGet full text
ISSN1884-8354
1884-8354
DOI10.1299/kikaic.56.1980

Cover

More Information
ISSN:1884-8354
1884-8354
DOI:10.1299/kikaic.56.1980