Single-machine scheduling with supporting tasks

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Kononov, A. V., Lin, B. M. T., & Fang, K.-T. (2015). Single-machine scheduling with supporting tasks. DISCRETE OPTIMIZATION, 17, 69–79. https://doi.org/10.1016/j.disopt.2015.05.001

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/128000