.png){kind=icon}
返回
EXACT AND APPROXIMATION ALGORITHMS FOR THE OPERATIONAL FIXED-INTERVAL SCHEDULING PROBLEM
.png){kind=icon}
OA
AI
DOI：10.1016/0377-2217(93)E0335-U.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Operational Fixed Interval Scheduling Problem (OFISP) is characterized as the problem of scheduling a number of jobs, each with a fixed starting time, a fixed finishing time, a priority index, and a job class. The objective is to find an assignment of jobs to machines with maximal total priority. The problem is complicated by the restrictions that: (i) each machine can handle only one job at a time, (ii) each machine can handle only jobs from a prespecified subset of all possible job classes, and (iii) preemption is not allowed. It follows from the above that OFISP has both the character of a job scheduling problem and the character of an assignment problem. In this paper we discuss the occurrence of the problem in practice, and we present newly developed exact and approximation algorithms for solving OFISP. Finally, some computational results are shown.
Keyword:
JOB SCHEDULING
INTEGER PROGRAMMING
LAGRANGEAN RELAXATION
HEURISTICS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容