| 一个双目标单机调度问题及其几个多项式可解情形 |
| |
| 引用本文： | 万国华. 一个双目标单机调度问题及其几个多项式可解情形[J]. 运筹与管理, 2001, 10(2): 99-104 |
| |
| 作者姓名： | 万国华 |
| |
| 作者单位： | 深圳大学,管理学院信息与系统管理学系,深圳,518060 |
| |
| 摘 要： | 研究了一个双目标单机调度问题及其几个多项式可解的情形。问题的主目标是延误工件数最小，在此条件下，最小化各工件加权提前期的总和，由于该问题是NP一难的，故研究求解它的一个启发式算法及问题的几个多项式可解的特殊情形。
|
| 关 键 词： | 单机调度 双目标 多项式算法 启发式算法 |
| 文章编号： | 1007-3221(2001)02-0099-06 |
A Single Machine Bi-criteria Scheduling Problem and its Several Polynomial Solvable Cases |
| |
| WAN Guo hua. A Single Machine Bi-criteria Scheduling Problem and its Several Polynomial Solvable Cases[J]. Operations Research and Management Science, 2001, 10(2): 99-104 |
| |
| Authors: | WAN Guo hua |
| |
| Abstract: | A single machine bi criteria scheduling problem and its several polynomial solvable cases are studied. The primary objective of the problem is the minimization of total number of tardy jobs. Subject to the primary objective, the total weighted earliness of all the jobs is to be minimized. Due to the NP-hardness of the problem, a heuristic is proposed and several polynomial solvable special cases are studied. |
| |
| Keywords: | single machine scheduling bi criteria polynomial algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
