位置：成果数据库 > 期刊 > 期刊详情页
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints
  • 期刊名称：Information Processing Letters
  • 时间：0
  • 作者或编辑：3448
  • 页码：88, 161-165, 2003
  • 语言：英文
  • 相关项目：NP困难排序问题的可近似性
作者： T.C.E. Cheng|Z.H. Liu|
同期刊论文项目
NP困难排序问题的可近似性
期刊论文 13
同项目期刊论文
关于延误时间的平行机排序问题的复杂性
Approximability of two-machine no-wait flowshop scheduling with availability constraints
Minimizing total completion time subject to job release dates and preemption penalties
Parallel machine scheduling to minimize the sum of quadratic completion times
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch