首页 | 本学科首页   官方微博 | 高级检索  
     


Scheduling problems with partially ordered jobs
Authors:V. S. Gordon  A. B. Dolgui
Affiliation:1. United Institute of Informatics Problems, Belarussian National Academy of Sciences, Minsk, Belarus
2. école Nationale Supérieure des Mines de Saint-étienne, Saint-étienne, France
Abstract:Scheduling problems with given precedence constraints (with partially ordered jobs) are considered. A review of the results obtained in this area by the members of Minsk Scheduling Theory school created by V.S. Tanaev is done.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号