摘要
n/1//■+■+问题是一种新的多目标排序问题.本文提出并证明了n/1//■+■+问题的六个最优判别条件,据此得出了一类特殊的n/1//■+■+问题的解法.
A new trend in scheduling research is the investigation on the multi-criterion problem. This paper is concerned with a kind of multicriterion problem where a linear combination of three objectives, namely, the mean flow time, mean tardiness and mean earliness, is involved. The mean flow time is a measure of the work-in-process level, mean tardiness one of customer service level, and mean earliness one of finished parts or products inventory level. Minimizing mean tardiness and mean earliness is based on the JIT (Just-in-Time) philosophy. To solve such a problem, six sufficient optimality conditions are proposed and proved. Using the six conditions, the optimal schedules for special cases of the problem can be found.
出处
《华中理工大学学报》
CSCD
北大核心
1992年第3期83-87,共5页
Journal of Huazhong University of Science and Technology
基金
国家自然科学基金资助项目
关键词
单台机器排序
多目标排序
判别条件
single mechine scheduling
multicriterion scheduling
optimality conditions