详细信息
加工时间和工期一致的单机主次指标排序问题1‖∑U︱T_(max)
Single Machine Primary-Secondary Criteria Scheduling Problem 1‖∑U_j︱T_(max)with the Jobs' Processing Times Being Agreeable with Their Due Dates
文献类型:期刊文献
中文题名:加工时间和工期一致的单机主次指标排序问题1‖∑U︱T_(max)
英文题名:Single Machine Primary-Secondary Criteria Scheduling Problem 1‖∑U_j︱T_(max)with the Jobs' Processing Times Being Agreeable with Their Due Dates
作者:孙玉芹[1];原晋江[2]
第一作者:孙玉芹
机构:[1]新乡师范高等专科学校数学系;[2]郑州大学数学系
第一机构:新乡学院数学与信息科学学院
年份:2004
卷号:13
期号:5
起止页码:26-30
中文期刊名:运筹与管理
外文期刊名:Operations Research and Management Science
收录:CSTPCD;;国家哲学社会科学学术期刊数据库;CSCD:【CSCD_E2011_2012】;
基金:国家自然科学基金资助项目(10371112)
语种:中文
中文关键词:排序;主次指标;最大误时;误时工件数;P问题
外文关键词:scheduling; primary-secondary criteria; maximum tardiness; the number of tardy jobs; polynomial-time algorithm
摘要:本文研究了单机主次指标排序问题1‖∑U︱Tmax。在加工时间和工期具有一致性的情形下,给出了该问题的多项式时间算法。
This paper studies the single machine primary-secondary criteria scheduling problem 1‖∑U_j︱T_(max). Under the case that the jobs' processing times are agreeable with their due dates, we give a polynomial-time algorithm for the problem.
参考文献:
正在载入数据...