Single-machine scheduling with supporting tasks

Alexander V. Kononov; Bertrand M.T. Lin; Kuei Tang Fang

doi:10.1016/j.disopt.2015.05.001

Single-machine scheduling with supporting tasks

Alexander V. Kononov, Bertrand M.T. Lin^*, Kuei Tang Fang

^*此作品的通信作者

資訊管理研究所

研究成果: Article › 同行評審

2 引文斯高帕斯（Scopus）

摘要

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.

原文	English
頁（從 - 到）	69-79
頁數	11
期刊	Discrete Optimization
卷	17
DOIs	https://doi.org/10.1016/j.disopt.2015.05.001
出版狀態	Published - 8月 2015

存取文件

10.1016/j.disopt.2015.05.001

其它文件與鏈接

Link to publication in Scopus

引用此

@article{b54c4ba1d3bd4ef19dc3f7dfb8efc026,

title = "Single-machine scheduling with supporting tasks",

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.",

keywords = "Number of late jobs, Single-machine scheduling, Supporting precedence, Total weighted completion time",

author = "Kononov, {Alexander V.} and Lin, {Bertrand M.T.} and Fang, {Kuei Tang}",

year = "2015",

month = aug,

doi = "10.1016/j.disopt.2015.05.001",

language = "English",

volume = "17",

pages = "69--79",

journal = "Discrete Optimization",

issn = "1572-5286",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Single-machine scheduling with supporting tasks

AU - Kononov, Alexander V.

AU - Lin, Bertrand M.T.

AU - Fang, Kuei Tang

PY - 2015/8

Y1 - 2015/8

N2 - 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.

AB - 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.

KW - Number of late jobs

KW - Single-machine scheduling

KW - Supporting precedence

KW - Total weighted completion time

UR - http://www.scopus.com/inward/record.url?scp=84930684130&partnerID=8YFLogxK

U2 - 10.1016/j.disopt.2015.05.001

DO - 10.1016/j.disopt.2015.05.001

M3 - Article

AN - SCOPUS:84930684130

SN - 1572-5286

VL - 17

SP - 69

EP - 79

JO - Discrete Optimization

JF - Discrete Optimization

ER -

Single-machine scheduling with supporting tasks

摘要

存取文件

其它文件與鏈接

指紋

引用此