跳至主導覽
跳至搜尋
跳過主要內容
國立陽明交通大學研發優勢分析平台 首頁
English
中文
首頁
人員
單位
研究成果
計畫
獎項
活動
貴重儀器
影響
按專業知識、姓名或所屬機構搜尋
查看斯高帕斯 (Scopus) 概要
姚 銘忠
教授
運輸與物流管理學系
h-index
h10-index
h5-index
726
引文
15
h-指數
按照存儲在普爾（Pure）的出版物數量及斯高帕斯（Scopus）引文計算。
55
引文
5
h-指數
按照存儲在普爾（Pure）的出版物數量及斯高帕斯（Scopus）引文計算。
42
引文
3
h-指數
按照存儲在普爾（Pure）的出版物數量及斯高帕斯（Scopus）引文計算。
1993 …
2023
每年研究成果
概覽
指紋
網路
計畫
(17)
研究成果
(57)
獎項
(2)
類似的個人檔案
(6)
指紋
查看啟用 Ming-Jong Yao 的研究主題。這些主題標籤來自此人的作品。共同形成了獨特的指紋。
排序方式
重量
按字母排序
Keyphrases
Economic Lot Scheduling Problem
89%
Search Algorithm
78%
Genetic Algorithm
71%
Numerical Experiments
57%
Supply Chain System
42%
Power-of-two Policy
42%
Solution Approach
38%
Joint Replenishment Problem
37%
Mathematical Model
36%
Maintenance Scheduling
33%
Replenishment
32%
Supply Chain
32%
Scheduling Problem
29%
Basic Period Approach
26%
Extended Basic Period
26%
Flow Shop
25%
Buyers
24%
Common Cycles
22%
Deteriorating Items
22%
Transportation Fleet
22%
Replenishment Strategy
22%
Warehouse
21%
Hybrid Genetic Algorithm
21%
Efficient Search
21%
Production Schedule
21%
Multiple Buyers
20%
Optimal Cost
20%
Replenishment Cycle
20%
Fleet Maintenance
19%
Vendor-buyer
18%
Warehouse Space
18%
Project Completion Time
17%
Cost Curve
17%
Space Constraints
16%
Retailers
16%
Active Networks
16%
Simple Heuristics
16%
Capacity Constraints
15%
Lot Sizing Policies
14%
Common Replenishment Epoch
14%
Seasonal Products
14%
Lateral Transshipment
14%
Household Products
14%
Inspection Scheduling
14%
Optimal Lot Size
14%
Just-in-time
14%
Probability Distribution Function
14%
Lot Sizing
14%
Lot-sizing Problem
14%
Objective Value
14%
Mathematics
Search Algorithm
92%
Numerical Experiment
70%
Minimizes
64%
Mathematical Modeling
55%
Total Cost
50%
Genetic Algorithm
44%
Optimality
34%
Objective Function
25%
Integer
21%
Period Approach
18%
Probability Distribution Function
14%
Global Optimum
14%
Discretization
14%
Stochastics
12%
Probability Density Function
12%
Random Experiment
12%
Concludes
11%
Cost Function
11%
Monte Carlo
11%
Unit Time
10%
Probability Theory
7%
Polynomial Time
7%
Linear Programming
7%
Opts _ _ _
7%
Feasible Solution
7%
Simultaneous Linear Equation
7%
Boltzmann Equation
7%
Random Search
7%
Minimization Problem
7%
Cumulative Distribution Function
7%
NP-hard Problem
7%
Decision Maker
7%
Integer Multiple
7%
Upper Bound
7%
Nonlinear Function
7%
Function Value
5%
Numerical Example
5%
Computer Science
Scheduling Problem
100%
Searching Algorithm
44%
Supply Chain
43%
Genetic Algorithm
42%
Activity Network
25%
Completion Time
17%
Candidate Solution
16%
Randomly Generated Instance
16%
Resource Allocation
14%
hybrid genetic algorithm
14%
Optimization Algorithm
14%
Space Requirement
14%
Production Schedule
14%
Capacity Constraint
13%
Discretization
13%
Random Experiment
12%
Objective Function
12%
Probability Density Function
11%
Approximation (Algorithm)
11%
Monte Carlo Simulation
10%
Business Process Re-Engineering
9%
Junction Point
7%
Global Optimal Solution
7%
inventory cost
7%
Global Optimization
7%
piecewise linear
7%
Tracing Algorithm
7%
Integer Multiple
7%
Enterprise Resource Planning
7%
Allocation Problem
7%
Temperature Reading
7%
Time Constraint
7%
System Management
7%
Approximation Algorithms
7%
Coordination Model
7%
Chance-Constrained Programming
7%
Obtain Solution
7%
Computational Efficiency
7%
Critical Evaluation
7%
Radio Frequency Identification
7%
Identification Technique
7%
Information System
7%
Utilization Rate
5%
Function Value
5%
Experimental Result
5%
Decision Supports
5%
Solution Quality
5%
