English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90451/105768 (86%)
Visitors : 10989635      Online Users : 438
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/111722


    Title: A new two-objective single machine scheduling problem considers a past-sequence-dependent setup time and learning effect
    Authors: Ch, Shih-Hsin;Chen, Shih-Hsin;陳宜惠;CHEN, YI-HUI;*
    Contributors: 行動商務與多媒體應用學系
    Date: 2018-07
    Issue Date: 2018-12-25 10:58:18 (UTC+8)
    Abstract: 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.
    Relation: IEEE International Conference on Knowledge Innovation and Invention
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML112View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


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