具有双工期的最小化最大延迟的双目标排序
구유쌍공기적최소화최대연지적쌍목표배서
Bicriteria Scheduling with Double Due Dates to Minimize the Maximum Lateness
  • 万方数据
    工程数学学报 공정수학학보
    CHINESE JOURNAL OF ENGINEERING MATHEMATICS
    2009年 1期 147-150 ,共4页

    何程%林诒勋%付乳燕

    하정%림이훈%부유연

    多目标排序%最大延迟%Pareto最优解 多目標排序%最大延遲%Pareto最優解
    다목표배서%최대연지%Pareto최우해
    multicriteria scheduling%maximum lateness%pareto optimal solutions
    本文研究一个双目标排序问题.由于决策者的利益不同,他们对工件的加工有不同的工期要求,因而可导出两个最大误工问题.我们证明了可在多项式时间内找到关于这两个目标函数的所有Pareto最优点.
    본문연구일개쌍목표배서문제.유우결책자적이익불동,타문대공건적가공유불동적공기요구,인이가도출량개최대오공문제.아문증명료가재다항식시간내조도관우저량개목표함수적소유Pareto최우점.
    This paper studies a bicriteria scheduling problem in which two objective functions are maximum latenesses induced by two sets of due dates,representing different interests of two decision-makers.We present a polynomial-time algorithm for finding all Pareto optimal solutions.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문