Single-machine scheduling with supporting tasks

doi:10.1016/j.disopt.2015.05.001

標題:	Single-machine scheduling with supporting tasks
作者:	Kononov, Alexander V. Lin, Bertrand M. T. Fang, Kuei-Tang 資訊管理與財務金融系註：原資管所+財金所 Department of Information Management and Finance
關鍵字:	Single-machine scheduling;Supporting precedence;Total weighted completion time;Number of late jobs
公開日期:	1-Aug-2015
摘要:	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.
URI:	http://dx.doi.org/10.1016/j.disopt.2015.05.001 http://hdl.handle.net/11536/128000
ISSN:	1572-5286
DOI:	10.1016/j.disopt.2015.05.001
期刊:	DISCRETE OPTIMIZATION
Volume:	17
起始頁:	69
結束頁:	79
Appears in Collections:	Articles