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


Complexity and approximability of scheduling resumable proportionally deteriorating jobs
Authors:Stanisław Gawiejnowicz  Alexander Kononov
Institution:1. Adam Mickiewicz University, Faculty of Mathematics and Computer Science, Umultowska 87, 61-614 Poznań, Poland;2. Sobolev Institute of Mathematics, Prospekt Akademika Koptyuga no. 4,630090 Novosibirsk, Russia
Abstract:
Keywords:Scheduling  Deteriorating jobs  Complexity theory  Fully polynomial-time approximation scheme
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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