Single-machine scheduling with supporting tasks
檔案
本條目沒有附加檔案。
日期
2015-08-01
類型
期刊名稱
DISCRETE OPTIMIZATION
卷期與頁次
第 17 卷,頁 69–79
ISSN
1572-5286
語言
英文
摘要
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.