| 来源类型 | Article |
| 规范类型 | 其他 |
| DOI | 10.1016/0377-2217(94)90348-4 |
| A network flow algorithm for just-in-time project scheduling. | |
| Levner EV; Nemirovsky AS | |
| 发表日期 | 1994 |
| 出处 | European Journal of Operational Research 79 (2): 167-175 |
| 出版年 | 1994 |
| 语种 | 英语 |
| 摘要 | We consider a project scheduling problem with the objective being a piecewise-linear, convex (possibly, non-monotone) function of the job durations as well as of job start/finish times. A version of ‘out-of-kilter’ algorithm of pseudo-linear complexity to handle this problem is provided. |
| 主题 | Methodology of Decision Analysis (MDA) |
| 关键词 | Project scheduling Just-in-time scheduling Out-of-kilter method Pseudo-polynomial algorithm |
| URL | http://pure.iiasa.ac.at/id/eprint/3883/ |
| 来源智库 | International Institute for Applied Systems Analysis (Austria) |
| 引用统计 | |
| 资源类型 | 智库出版物 |
| 条目标识符 | http://119.78.100.153/handle/2XGU8XDN/127273 |
| 推荐引用方式 GB/T 7714 | Levner EV,Nemirovsky AS. A network flow algorithm for just-in-time project scheduling.. 1994. |
| 条目包含的文件 | 条目无相关文件。 | |||||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Levner EV]的文章 |
| [Nemirovsky AS]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Levner EV]的文章 |
| [Nemirovsky AS]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Levner EV]的文章 |
| [Nemirovsky AS]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
