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


A faster fully polynomial approximation scheme for the single-machine total tardiness problem
Authors:Christos Koulamas
Institution:Department of Decision Sciences and Information Systems, Florida International University, Miami, FL 33199, United States
Abstract:
Keywords:Single-machine sequencing  Total tardiness  Fully polynomial approximation
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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