Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms

Kai Li; Shan lin Yang

doi:10.1016/j.apm.2008.05.019

Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms

Kai Li
, Shan lin Yang

Hefei University of Technology

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

75 引用（Scopus）

摘要

We consider a class of non-identical parallel-machine scheduling problems in which the goal is to minimize total (or mean) weighted (or unweighted) completion time. Models and relaxations are collected and classified in this paper. Heuristics and optimizing techniques are surveyed for the problems. And a few of interesting areas for future research are also provided. Crown

源语言	英语
页（从-至）	2145-2158
页数	14
期刊	Applied Mathematical Modelling
卷	33
期	4
DOI	https://doi.org/10.1016/j.apm.2008.05.019
出版状态	已出版 - 4月 2009
已对外发布	是

访问文件

10.1016/j.apm.2008.05.019

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{a951608a3c394262b9bb121f099924e1,

title = "Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms",

abstract = "We consider a class of non-identical parallel-machine scheduling problems in which the goal is to minimize total (or mean) weighted (or unweighted) completion time. Models and relaxations are collected and classified in this paper. Heuristics and optimizing techniques are surveyed for the problems. And a few of interesting areas for future research are also provided. Crown",

keywords = "Algorithm, Model, Parallel-machine scheduling, Relaxation, Total weighted completion time",

author = "Kai Li and Yang, \{Shan lin\}",

year = "2009",

month = apr,

doi = "10.1016/j.apm.2008.05.019",

language = "英语",

volume = "33",

pages = "2145--2158",

journal = "Applied Mathematical Modelling",

issn = "0307-904X",

publisher = "Elsevier Inc.",

number = "4",

}

TY - JOUR

T1 - Non-identical parallel-machine scheduling research with minimizing total weighted completion times

T2 - Models, relaxations and algorithms

AU - Li, Kai

AU - Yang, Shan lin

PY - 2009/4

Y1 - 2009/4

N2 - We consider a class of non-identical parallel-machine scheduling problems in which the goal is to minimize total (or mean) weighted (or unweighted) completion time. Models and relaxations are collected and classified in this paper. Heuristics and optimizing techniques are surveyed for the problems. And a few of interesting areas for future research are also provided. Crown

AB - We consider a class of non-identical parallel-machine scheduling problems in which the goal is to minimize total (or mean) weighted (or unweighted) completion time. Models and relaxations are collected and classified in this paper. Heuristics and optimizing techniques are surveyed for the problems. And a few of interesting areas for future research are also provided. Crown

KW - Algorithm

KW - Model

KW - Parallel-machine scheduling

KW - Relaxation

KW - Total weighted completion time

UR - https://www.scopus.com/pages/publications/57649108662

U2 - 10.1016/j.apm.2008.05.019

DO - 10.1016/j.apm.2008.05.019

M3 - 文章

AN - SCOPUS:57649108662

SN - 0307-904X

VL - 33

SP - 2145

EP - 2158

JO - Applied Mathematical Modelling

JF - Applied Mathematical Modelling

IS - 4

ER -

Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms

摘要

访问文件

其它文件与链接

学术指纹

引用此