完整後設資料紀錄
DC 欄位語言
dc.contributor.authorBlazewicz, Jaceken_US
dc.contributor.authorChen, Xinen_US
dc.contributor.authorLee, Richard C. T.en_US
dc.contributor.authorLin, Bertrand M. T.en_US
dc.contributor.authorLin, Feng-Chengen_US
dc.contributor.authorPesch, Erwinen_US
dc.contributor.authorSterna, Malgorzataen_US
dc.contributor.authorWang, Zhongyuen_US
dc.date.accessioned2019-06-03T01:08:38Z-
dc.date.available2019-06-03T01:08:38Z-
dc.date.issued2019-07-03en_US
dc.identifier.issn0305-215Xen_US
dc.identifier.urihttp://dx.doi.org/10.1080/0305215X.2018.1554066en_US
dc.identifier.urihttp://hdl.handle.net/11536/151992-
dc.language.isoen_USen_US
dc.titleClarification of lower bounds of two-machine flow-shop scheduling to minimize total late worken_US
dc.typeArticleen_US
dc.identifier.doi10.1080/0305215X.2018.1554066en_US
dc.identifier.journalENGINEERING OPTIMIZATIONen_US
dc.citation.volume51en_US
dc.citation.issue7en_US
dc.citation.spage1279en_US
dc.citation.epage1280en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000467841400011en_US
dc.citation.woscount0en_US
顯示於類別:期刊論文