.png){kind=icon}
返回
SINGLE-MACHINE SCHEDULING WITH START TIME-DEPENDENT PROCESSING TIMES - SOME SOLVABLE CASES
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)90048-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper a new type of single machine scheduling problem, in which the processing time is a binary function of a common start time due date is defined. The jobs have processing time penalties for starting after the due date, and the objective is to minimize the sum of the weighted completion times. The general case addressed here is for jobs with common pre-duedate processing time, general post-duedate processing time penalties, and general weights. A switching algorithm is proposed for this case and we conjecture that it is optimal. A 0-1 quadratic programming formulation of this problem is presented. Solvable cases, one with two different weights, another with two different penalties and another with structured weights and penalties have been identified and polynomial time optimal algorithms have been proposed for them.
Keyword:
SCHEDULING
ALGORITHMS
QUADRATIC PROGRAMMING
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏MINIMIZING THE MAKESPAN WITH LATE START PENALTIES ADDED TO PROCESSING TIMES IN A SINGLE FACILITY SCHEDULING PROBLEM在单个设施调度问题中，通过增加处理时间的延迟启动惩罚来最小化完工时间
PREAI
分享收藏
没有更多内容
没有更多内容