首页 | 本学科首页   官方微博 | 高级检索  
     检索      

单机主次指标排序问题1|(rj, dj) agreeable, pj = p, pmtn|∑Uj|Tmax
引用本文:孙玉芹,原晋江.单机主次指标排序问题1|(rj, dj) agreeable, pj = p, pmtn|∑Uj|Tmax[J].运筹学学报,2005,9(2):63-67.
作者姓名:孙玉芹  原晋江
作者单位:1. 同济大学应用数学系,上海,200092
2. 郑州大学数学系,郑州,450052
摘    要:本文研究了单机主次指标排序问题1|rj,pmtn|∑Uj|Tmax.在同工期且准备时间和工期具有一致性的情形下,给出了该问题的允许中断抢先的多项式时间算法.

关 键 词:排序问题  指标  单机  pm  多项式时间算法  准备时间  一致性  工期

Single-Machine Primary-Secondary Criteria Scheduling Problem 1|(rj,dj) agreeable, pj = p, pmtn|∑Uj|Tmax
Sun Yuqin,Yuan Jinjiang.Single-Machine Primary-Secondary Criteria Scheduling Problem 1|(rj,dj) agreeable, pj = p, pmtn|∑Uj|Tmax[J].OR Transactions,2005,9(2):63-67.
Authors:Sun Yuqin  Yuan Jinjiang
Abstract:This paper studies the single-machine primary-secondary criteria scheduling problem1|rj,pmtn| ∑ Uj |Tmax. Under the case that the jobs' processing times are common and their release dates are agreeable with their due dates, we give a preemptive scheduling polynomial-time algorithm that optimally solve the problem.
Keywords:Operations Research  scheduling  primary-secondary criteria  maximum tardiness  the number of tardy jobs  polynomial-time algorithm
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号