淡江大學機構典藏:Item 987654321/121534
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 64191/96979 (66%)
造访人次 : 8406442      在线人数 : 8024
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121534


    题名: Bi-criterion Single machine scheduling problem with a past-sequence-dependent setup times and learning effect
    作者: Chen, S. H.;Mani, V.;Chen, Y. H.
    关键词: Indexes;Single machine scheduling;Video recording;Yttrium;Information management;Aerospace engineering;Multimedia communication
    日期: 2015-12-06
    上传时间: 2021-10-21 12:11:40 (UTC+8)
    摘要: This paper considers the bi-criterion single machine scheduling problem of n jobs with a past-sequence-dependent setup times (PSD) and learning effect (LE) together. The two objectives considered are the total completion time (TC) and total absolute differences in completion times (TADC). We consider only the objective TC, we obtain an unique optimal sequence (solution). We study the objective TADC to obtain a unique optimal sequence (solution). If both the TC and TADC are considered together, a set of optimal sequences that performs well with respect to both the objectives TC and TADC would be obtained. This set of optimal sequences is the minimum set of optimal sequences (MSOS). Our purpose in this paper is to find this minimum set of optimal sequences (MSOS) that performs well with respect to both the objectives TC and TADC.
    DOI: 10.1109/IEEM.2015.7385633
    显示于类别:[資訊工程學系暨研究所] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML67检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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