| 来源类型 | Monograph (IIASA Collaborative Paper) |
| 规范类型 | 论文 |
| MPS - Decision Support System for Multiobjective Project Scheduling. | |
| Slowinski R; Soniewicki B; Weglarz J | |
| 发表日期 | 1991 |
| 出版者 | IIASA, Laxenburg, Austria: CP-91-007 |
| 出版年 | 1991 |
| 语种 | 英语 |
| 摘要 | The report presents a decision support system (DSS) for multiobjective project scheduling under multiple-category resource constraints. It handles quite a general class of nonpreemptive scheduling problems with renewable, nonrenewable and doubly-constrained resources, multiple performing modes of activities, precedence constraints in the form of an activity network and multiple project performance criteria of time and cost type. The DSS has been implemented on a microcomputer compatible with IBM PC, and called MPS. It is based on three kinds of heuristics: parallel priority rules, simulated annealing and branch-and-bound. The last algorithm can even yield exact solutions when sufficient processing time is available. Some parts of the MPS are interactive, in particular, the search for a best compromise schedule. Graphical facilities enable a thorough evaluation of feasible schedules. The report starts with a methodological guide presenting the problem formulation and the three heuristics. Then, the general scheme of the MPS is given together with an executive guide. An expanding menu and all its options are described and illustrated with a simple example. The last part presents a real problem solving consisting in scheduling 40 farm activities. |
| 主题 | Methodology of Decision Analysis (MDA) |
| URL | http://pure.iiasa.ac.at/id/eprint/3573/ |
| 来源智库 | International Institute for Applied Systems Analysis (Austria) |
| 资源类型 | 智库出版物 |
| 条目标识符 | http://119.78.100.153/handle/2XGU8XDN/123884 |
| 推荐引用方式 GB/T 7714 | Slowinski R,Soniewicki B,Weglarz J. MPS - Decision Support System for Multiobjective Project Scheduling.. 1991. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 资源类型 | 版本类型 | 开放类型 | 使用许可 | ||
| CP-91-007.pdf（906KB） | 智库出版物 | 限制开放 | CC BY-NC-SA | 浏览 | ||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
