1//T_(max)在应交工时间可控时有效点集的求解 Construction of Efficient Point Set of 1//T_(max) Corresponding to Controllable Due Dates期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

1//T_(max)在应交工时间可控时有效点集的求解

引用本文：	黄文平,孙世杰,R.J.Kibet. 1//T_(max)在应交工时间可控时有效点集的求解[J]. 上海大学学报(自然科学版), 2002, 0(3)

作者姓名：	黄文平孙世杰 R.J.Kibet

作者单位：	上海大学理学院上海200436(黄文平，孙世杰)，上海大学理学院上海200436(R.J.Kibet)

摘要：	考虑应交工时间可控时的 1//Tmax问题 ,以 F1 表示 Tmax、F2 表示应交工时间加权滞后和 .对 F1 、F2 的同时极小化 ,文中给出可构造有效点集的伪多项式时间算法 .
关键词：	排序应交工时间可控有效点集伪多项式时间算法
Construction of Efficient Point Set of 1//T_(max) Corresponding to Controllable Due Dates

HUANG Wen ping,SUN Shi jie,R.J. Kibet. Construction of Efficient Point Set of 1//T_(max) Corresponding to Controllable Due Dates[J]. Journal of Shanghai University(Natural Science), 2002, 0(3)

Authors:	HUANG Wen ping SUN Shi jie R.J. Kibet

Abstract:	This paper considers the sequencing problem of 1// T max with controllable due dates. Let F 1 and F 2 represent T max and the sum of the weighted due date delays.For the problem of minimizing F 1 and F 2 simultaneously, this paper develops a pseudopolynomial algorithm for the construction of the efficient point set.

Keywords:	scheduling controllable due date the set of efficient points pseudopolynomial algorithm
本文献已被 CNKI 等数据库收录！