| Lawler最小最大化原则用于成组排序问题1｜s1｜fmax |
| |
| 引用本文： | 张峰.Lawler最小最大化原则用于成组排序问题1｜s1｜fmax[J].上海第二工业大学学报,1996,13(1):48-50. |
| |
| 作者姓名： | 张峰 |
| |
| 摘 要： | 本文讨论了成组排序问题，规定工件必须按要求分成若干组进行加工，一组内的工件必须连续加工，我们给出了最大费用问题最优序条件以及求最优序的算法。
|
| 关 键 词： | 排序 成组加工 |
Applying Lawler's Max-min Principle to Batching Problem 1|S_1|f_(max) |
| |
| Zhang Feng.Applying Lawler''s Max-min Principle to Batching Problem 1|S_1|f_(max)[J].Journal of Shanghai Second Polytechnic University,1996,13(1):48-50. |
| |
| Authors: | Zhang Feng |
| |
| Affiliation: | Department of Applied Mathematics |
| |
| Abstract: | This paper considers the problem of batching scheduling, in which jobs in each batchmust be processed contiguously. We present an optimal condition for the maximum cost and aalgorithm to find the optimal sequence. |
| |
| Keywords: | scheduling batching processing |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《上海第二工业大学学报》浏览原始摘要信息 |
|
点击此处可从《上海第二工业大学学报》下载全文 |
