文章基本信息

标题：On Scheduling Problems with Forbidden Stack-Overflows
本地全文：下载
作者：Frank Werner ; Evgeny Gafarov
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2019
卷号：52
期号：13
页码：83-87
DOI：10.1016/j.ifacol.2019.11.139
语种：English
出版社：Elsevier
摘要：In this paper, we consider some special resource-constrained scheduling problems, which occur e.g. in production or in computer science. We consider the minimization of the makespan as well as total tardiness. Some complexity and approximability results are given as well as relationships to other scheduling problems.
关键词：KeywordsSchedulingResource constraintsTotal tardinessmakespanNP-hardness