期刊論文
| 學年 | 97 |
|---|---|
| 學期 | 2 |
| 出版（發表）日期 | 2009-07-01 |
| 作品名稱 | Bi-criteria single machine scheduling problem with a learning effect: Aneja–Nair method to obtain the set of optimal sequences |
| 作品名稱（其他語言） | |
| 著者 | Mani, V.; P. C. Chang; S. H. Chen |
| 單位 | |
| 出版者 | |
| 著錄名稱、卷期、頁數 | Computers and mathematics with applications 58(1), p.39-47. |
| 摘要 | In this paper, we consider the bi-criteria single machine scheduling problem of n jobs with a learning effect. The two objectives considered are the total completion time (TC) and total absolute differences in completion times (TADC). The objective is to find a sequence that performs well with respect to both the objectives: the total completion time and the total absolute differences in completion times. In an earlier study, a method of solving bi-criteria transportation problem is presented. In this paper, we use the methodology of solving bi-criteria transportation problem, to our bi-criteria single machine scheduling problem with a learning effect, and obtain the set of optimal sequences,. Numerical examples are presented for illustrating the applicability and ease of understanding. |
| 關鍵字 | Single machine scheduling;Bi-criteria problem;Learning effect;Non-dominated solution |
| 語言 | en |
| ISSN | 1873-7668 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 是 |
| 國別 | GBR |
| 公開徵稿 | |
| 出版型式 | ,電子版,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/121412 ) |