ASIA unversity:Item 310904400/111722
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 90570/105786 (86%)
造訪人次 : 16376366      線上人數 : 336
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/111722


    題名: A new two-objective single machine scheduling problem considers a past-sequence-dependent setup time and learning effect
    作者: Ch, Shih-Hsin;Chen, Shih-Hsin;陳宜惠;CHEN, YI-HUI;*
    貢獻者: 行動商務與多媒體應用學系
    日期: 2018-07
    上傳時間: 2018-12-25 10:58:18 (UTC+8)
    摘要: This work solved a new two-objective scheduling problem of n jobs considering past-sequence-dependent setup time (PSD) and learning effect (LE) on a single machine. Although researchers gradually consider PSD and LE, there is none who deals with both effects in the bi-criteria problems. The reason is that multi-objective problem is harder than a single objective problem because we need to acquire Pareto solutions. As a result, this paper is the first one who solves this issue. We considered two objective functions. To tackle with this new problem, we proposed a method to solve it effectively. We first analyzed the parameters according to the weights on each position of the two objectives. Then, we matched the weights with the processing time of the jobs. So that two optimal sequences were obtained by this matching approach. In addition, we started to search a new Pareto solution located between the two new solutions. The process was repeated to search a pair of solutions until no new solutions were found. Our approach was very efficient to find out the minimum set of optimal sequences (MSOS). To evaluate the proposed method, we compared it with the benchmark multi-objective algorithm, MOEA/D, on numerous instances. The empirical results had shown the proposed algorithm was effective when searching a set of approximate solutions in a very short CPU time when it was compared with MOEA/D. This proposed algorithm was promising to deal with the two-objective scheduling problem in this research.
    關聯: IEEE International Conference on Knowledge Innovation and Invention
    顯示於類別:[行動商務與多媒體應用學系] 期刊論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    index.html0KbHTML248檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋