跳至主導覽
跳至搜尋
跳過主要內容
國立陽明交通大學研發優勢分析平台 首頁
English
中文
首頁
人員
單位
研究成果
計畫
獎項
活動
貴重儀器
影響
按專業知識、姓名或所屬機構搜尋
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||C
max
A. V. Kononov, M. Y. Kovalyov,
Bertrand M.T. Lin
*
*
此作品的通信作者
資訊管理研究所
研究成果
:
Article
›
同行評審
3
引文 斯高帕斯（Scopus）
總覽
指紋
指紋
深入研究「Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||C
max
」主題。共同形成了獨特的指紋。
排序方式
重量
按字母排序
Keyphrases
Scheduling Problem
100%
Approximation Algorithms
100%
Cmax
100%
Approximate Solution
100%
Machine Assignment
100%
Minimization Problem
66%
Polynomial Time
66%
Strong NP-hardness
33%
Dynamic Programming Algorithm
33%
Time Dynamics
33%
Processing Time
33%
Job Processing
33%
Performance Ratio
33%
Bi-criteria
33%
Makespan
33%
Makespan Minimization
33%
Polynomial-time Approximation Algorithm
33%
Machine Cost
33%
Research Time
33%
Guaranteed Approximation Ratio
33%
Computer Science
Scheduling Problem
100%
Approximation Algorithms
100%
Approximate Solution
100%
Polynomial Time
75%
Minimization Problem
50%
Dynamic Programming Algorithm
25%
Processing Time
25%
Approximation Ratio
25%
Performance Ratio
25%
Primary Objective
25%
Mathematics
Polynomial Time
100%
Approximate Solution
100%
Minimization Problem
66%
Fixed Number
33%
Primary Objective
33%