| 題名: | Bi-criteria single machine scheduling problem with a learning effect: Aneja–Nair method to obtain the set of optimal sequences |
| 作者: | Mani, V.;Chang, P. C.;Chen, S. H. |
| 關鍵詞: | Single machine scheduling;Bi-criteria problem;Learning effect;Non-dominated solution |
| 日期: | 2009-07 |
| 上傳時間: | 2021-09-30 12:10:36 (UTC+8) |
| 摘要: | 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. |
| 關聯: | Computers and mathematics with applications 58(1), p.39-47. |
| DOI: | 10.1016/j.camwa.2009.01.042 |
| 顯示於類別: | [資訊工程學系暨研究所] 期刊論文
|