Single-machine scheduling with supporting tasks

doi:10.1016/j.disopt.2015.05.001

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kononov, Alexander V.	en_US
dc.contributor.author	Lin, Bertrand M. T.	en_US
dc.contributor.author	Fang, Kuei-Tang	en_US
dc.date.accessioned	2015-12-02T02:59:17Z	-
dc.date.available	2015-12-02T02:59:17Z	-
dc.date.issued	2015-08-01	en_US
dc.identifier.issn	1572-5286	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.disopt.2015.05.001	en_US
dc.identifier.uri	http://hdl.handle.net/11536/128000	-
dc.description.abstract	This paper investigates a single-machine scheduling problem with a set of supporting tasks and a set of jobs. Each job is preceded by a subset of supporting tasks, that is, the job cannot start its processing until all of its supporting tasks are finished. The objective functions are defined solely in job completion times. We discuss the complexities of several special cases for the number of late jobs and the total weighted completion time. This study adds new complexity results to the two standard objective functions under precedence constraints. (C) 2015 Elsevier B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	Single-machine scheduling	en_US
dc.subject	Supporting precedence	en_US
dc.subject	Total weighted completion time	en_US
dc.subject	Number of late jobs	en_US
dc.title	Single-machine scheduling with supporting tasks	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.disopt.2015.05.001	en_US
dc.identifier.journal	DISCRETE OPTIMIZATION	en_US
dc.citation.volume	17	en_US
dc.citation.spage	69	en_US
dc.citation.epage	79	en_US
dc.contributor.department	資訊管理與財務金融系註：原資管所+財金所	zh_TW
dc.contributor.department	Department of Information Management and Finance	en_US
dc.identifier.wosnumber	WOS:000358630000005	en_US
dc.citation.woscount	0	en_US
Appears in Collections:	Articles