Show simple item record

dc.contributor.author彭洪
dc.contributor.author张阿卜
dc.date.accessioned2016-05-17T02:46:02Z
dc.date.available2016-05-17T02:46:02Z
dc.date.issued1999
dc.identifier.citation厦门大学学报(自然科学版),1999,(1):31-35
dc.identifier.issn0438-0479
dc.identifier.otherXDZK901.005
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/106044
dc.description.abstract通过极大极小代数的方法对串行生产线进行建模,并给出了JOHnSOn算法的严格证明
dc.description.abstractThe authors prove strictly the Johnson algorithm by modeling the serial production line and based on minimax algebra.
dc.description.sponsorship福建省自然科学基金
dc.language.isozh_CN
dc.subject离散事件动态系统
dc.subjectJohnson算法
dc.subject极大极小代数
dc.subjectDiscrete event dynamic system
dc.subjectJohnson algorithm
dc.subjectMinimax algebra
dc.titleJohnson算法的极大极小代数证明
dc.title.alternativeJohnson Algorithm Proved by Minimax Algebra Method
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record