ASIA unversity:Item 310904400/111722
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90453/105671 (86%)
造访人次 : 16036397      在线人数 : 125
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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.html0KbHTML233检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


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