跳到主要导航 跳到搜索 跳到主要内容

Complexity of minimize total weighted average completion time scheduling problems with release times

  • Ling Shi
  • , Chun Xu
  • , Xue-guang Cheng
  • Deportment of Mathematics

科研成果: 期刊稿件 › 论文 › 同行评审

摘要

The paper considers the problem of scheduling n jobs in a two-machine flow-shop to minimize the weighted sum of completion times. Between the completion of an operation and the beginning of the next operation of the same job, there is a time lag, which wherever to it as the transportation delays. All transportation delays have to be done by a single robot, which can perform at most one transportation at a time. And release dates rj may be given for the jobs. New complexity results are derived for special case. For a new heuristic algorithm, the worst-case performance is 3/2, and the bound is tight.
源语言英语
页(从-至)381-391
页数11
期刊Applied Mathematical Sciences
卷4
期5-8
出版状态已出版 - 1月 2010

关键词

  • Complexity
  • Flow-shop scheduling problem
  • Release times
  • Single robot
  • Transportation delays

收录

  • Scopus

学术指纹

探究 'Complexity of minimize total weighted average completion time scheduling problems with release times' 的科研主题。它们共同构成独一无二的学术指纹。

引用此