Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work

Full metadata record

DC Field	Value	Language
dc.contributor.author	Blazewicz, Jacek	en_US
dc.contributor.author	Chen, Xin	en_US
dc.contributor.author	Lee, Richard C. T.	en_US
dc.contributor.author	Lin, Bertrand M. T.	en_US
dc.contributor.author	Lin, Feng-Cheng	en_US
dc.contributor.author	Pesch, Erwin	en_US
dc.contributor.author	Sterna, Malgorzata	en_US
dc.contributor.author	Wang, Zhongyu	en_US
dc.date.accessioned	2019-06-03T01:08:38Z	-
dc.date.available	2019-06-03T01:08:38Z	-
dc.date.issued	2019-07-03	en_US
dc.identifier.issn	0305-215X	en_US
dc.identifier.uri	http://dx.doi.org/10.1080/0305215X.2018.1554066	en_US
dc.identifier.uri	http://hdl.handle.net/11536/151992	-
dc.language.iso	en_US	en_US
dc.title	Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1080/0305215X.2018.1554066	en_US
dc.identifier.journal	ENGINEERING OPTIMIZATION	en_US
dc.citation.volume	51	en_US
dc.citation.issue	7	en_US
dc.citation.spage	1279	en_US
dc.citation.epage	1280	en_US
dc.contributor.department	資訊管理與財務金融系註：原資管所+財金所	zh_TW
dc.contributor.department	Department of Information Management and Finance	en_US
dc.identifier.wosnumber	WOS:000467841400011	en_US
dc.citation.woscount	0	en_US
Appears in Collections:	Articles