跳至主導覽
跳至搜尋
跳過主要內容
國立陽明交通大學研發優勢分析平台 首頁
English
中文
首頁
人員
單位
研究成果
計畫
獎項
活動
貴重儀器
影響
按專業知識、姓名或所屬機構搜尋
Maximizing total early work in a distributed two-machine flow-shop
Alexandre Dolgui, Mikhail Y. Kovalyov,
Bertrand M.T. Lin
*
*
此作品的通信作者
資訊管理研究所
研究成果
:
Article
›
同行評審
8
引文 斯高帕斯(Scopus)
總覽
指紋
指紋
深入研究「Maximizing total early work in a distributed two-machine flow-shop」主題。共同形成了獨特的指紋。
排序方式
重量
按字母排序
Keyphrases
Dynamic Programming Algorithm
100%
Time Dynamics
100%
Two-machine Flow Shop
100%
Fully Polynomial Time Approximation Scheme
75%
Unweighting
50%
Common Due Date
25%
Integer Linear Programming Formulations
25%
Integer Linear Programming Model
25%
Computational Experiment
25%
Problem Properties
25%
Distributed Settings
25%
Engineering
Early Work
100%
Dynamic Programming
100%
Polynomial Time
75%
Linear Programming
50%
Programming Model
25%
Computer Science
Dynamic Programming Algorithm
100%
Fully Polynomial-Time Approximation Scheme
75%
Integer-Linear Programming
50%
Programming Model
25%
Computational Experiment
25%
Mathematics
Fully Polynomial-Time Approximation Scheme
100%
Integer
66%
Linear Programming
66%
Running Time
33%