跳至主導覽
跳至搜尋
跳過主要內容
國立中央大學 首頁
說明與常見問題
English
中文
首頁
人才檔案
研究單位
研究計畫
研究成果
資料集
榮譽/獲獎
學術活動
新聞/媒體
影響
按專業知識、姓名或所屬機構搜尋
Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
Gwo Ji Sheen
, Lu Wen Liao
工業管理研究所
研究成果
:
雜誌貢獻
›
期刊論文
›
同行評審
15
引文 斯高帕斯（Scopus）
總覽
指紋
指紋
深入研究「Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints」主題。共同形成了獨特的指紋。
排序方式
重量
按字母排序
Keyphrases
Scheduling Problem
100%
Availability Constraints
100%
Lateness
100%
Lmax
80%
Polynomial Time
40%
Eligibility Requirements
40%
Maximum Flow Problem
40%
Maximum Lateness
40%
Machine Eligibility
40%
Machine Availability Constraint
40%
Binary Search
40%
Planning Horizon
40%
Time Complexity
20%
Network Flow
20%
Flow Method
20%
Preventive Maintenance
20%
Feasible Schedule
20%
Due Date
20%
Completion Time
20%
Parallel Machine Scheduling
20%
Algorithm Complexity
20%
Engineering
Flow Problem
100%
Planning Horizon
100%
Search Algorithm
100%
Binary Search
100%
Polynomial Time
100%
Machine Dependent
100%
Preventive Maintenance
50%
Mathematics
Planning Horizon
100%
Minimizes
100%
Search Algorithm
100%
Polynomial Time
100%
Preventive Maintenance
50%
Computer Science
Scheduling Problem
100%
Machine Dependent
100%
Searching Algorithm
40%
Polynomial Time
40%
Planning Horizon
40%
Time Complexity
20%
Feasible Schedule
20%
Completion Time
20%
Preventive Maintenance
20%
Parallel Machine Scheduling
20%