Skip to main content
Log In
Communities & Collections
All of DSpace
Statistics
Home
學術出版;;Publications
期刊論文;;Articles
Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
Loading...
Date
2019-07-03
Authors
Blazewicz, Jacek
Chen, Xin
Lee, Richard C. T.
Lin, Bertrand M. T.
Lin, Feng-Cheng
Pesch, Erwin
Sterna, Malgorzata
Wang, Zhongyu
Journal Title
Journal ISSN
Volume Title
Publisher
DOI
10.1080/0305215X.2018.1554066
Abstract
Description
Keywords
Citation
URI
http://dx.doi.org/10.1080/0305215X.2018.1554066
https://ir.lib.nycu.edu.tw/handle/11536/151992
Collections
期刊論文;;Articles
Endorsement
Review
Supplemented By
Referenced By
Full item page