淡江大學機構典藏:Item 987654321/121411
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 64188/96968 (66%)
造访人次 : 11333489      在线人数 : 338
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/121411


    题名: A parametric analysis for single machine scheduling with past-sequence-dependent setup times
    作者: Mani, V.;Chang, P. C.;Chen, S. H.
    日期: 2010-03
    上传时间: 2021-09-30 12:10:34 (UTC+8)
    摘要: Recently, the single machine scheduling problem with past-sequence-dependent (p-s-d) setup times is getting more attentions from academic researchers and industrial practitioners. The past-sequence-dependent setup times are proportional to the length of already scheduled jobs. It is shown that for a number of objective functions this scheduling problem can be solved in O(n log n) time. In this paper, we extend the analysis of the problem with the total absolute difference in completion times (TADC) as the objective function. This problem is denoted as 1/spsd/T ADC in [1]. Let s[j] and p[j] be the setup time and processing time of a job occupying position j in the sequence respectively, and s[j] is defined as s[j] = γ ∑j−1 i=1 p[i] , where γ is a normalizing constant. In this paper, we present a parametric analysis of γ on the 1/spsd/T ADC problem. We show analytically the number of optimal sequences and the range of γ in which each of the sequence is optimal. We prove that the number of optimal sequences is {1 + ∑x k=1(2k)} if n is odd, and {1+∑x k=1(2k−1)} if n is even. The value of x is b n 2 c−1 when n is odd, and x is n 2 when is even. The number of optimal sequences depends only on n, the number of jobs, and not on γ. We also show analytically that when γ > (n−3) 2(n−2) , the optimal sequence is unique and is obtained by placing the longest job in first position and the rest of the jobs in SPT order in positions 2 to n.
    關聯: International Journal of Innovative Computing, Information and Control 6(3A), p.1113–1121
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    A parametric analysis for single machine scheduling with past-sequence-dependent setup times.pdf190KbAdobe PDF1检视/开启
    index.html0KbHTML79检视/开启

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

    TAIR相关文章

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