Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F).

Li Kai; Yang Shanlin

doi:10.1016/S1004-4132(08)60160-7

Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F).

Li Kai
, Yang Shanlin

Hefei University of Technology

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

7 引用（Scopus）

摘要

A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.

源语言	英语
页（从-至）	827-834
页数	8
期刊	Journal of Systems Engineering and Electronics
卷	19
期	4
DOI	https://doi.org/10.1016/S1004-4132(08)60160-7
出版状态	已出版 - 8月 2008
已对外发布	是

访问文件

10.1016/S1004-4132(08)60160-7

其它文件与链接

链接到 Scopus 的出版物

学术指纹

探究 'Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F).' 的科研主题。它们共同构成独一无二的学术指纹。

引用此

Kai, L., & Shanlin, Y. (2008). Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F). Journal of Systems Engineering and Electronics, 19(4), 827-834. https://doi.org/10.1016/S1004-4132(08)60160-7

Kai, Li ; Shanlin, Yang. / Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F). 在: Journal of Systems Engineering and Electronics. 2008 ; 卷 19, 号码 4. 页码 827-834.

@article{169ab1d67c3a4d2b954d7512507bb29b,

title = "Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F).",

abstract = "A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.",

keywords = "algorithm, parallel machine, relaxation, review, scheduling, total weighted completion time",

author = "Li Kai and Yang Shanlin",

year = "2008",

month = aug,

doi = "10.1016/S1004-4132(08)60160-7",

language = "英语",

volume = "19",

pages = "827--834",

journal = "Journal of Systems Engineering and Electronics",

issn = "1004-4132",

publisher = "Beijing Institute of Aerospace Information",

number = "4",

}

Kai, L & Shanlin, Y 2008, 'Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F).', Journal of Systems Engineering and Electronics, 卷 19, 号码 4, 页码 827-834. https://doi.org/10.1016/S1004-4132(08)60160-7

Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F). / Kai, Li; Shanlin, Yang.
在: Journal of Systems Engineering and Electronics, 卷 19, 号码 4, 08.2008, 页码 827-834.

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

TY - JOUR

T1 - Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F).

AU - Kai, Li

AU - Shanlin, Yang

PY - 2008/8

Y1 - 2008/8

N2 - A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.

AB - A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.

KW - algorithm

KW - parallel machine

KW - relaxation

KW - review

KW - scheduling

KW - total weighted completion time

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

U2 - 10.1016/S1004-4132(08)60160-7

DO - 10.1016/S1004-4132(08)60160-7

M3 - 文章

AN - SCOPUS:58649086760

SN - 1004-4132

VL - 19

SP - 827

EP - 834

JO - Journal of Systems Engineering and Electronics

JF - Journal of Systems Engineering and Electronics

IS - 4

ER -

Kai L, Shanlin Y. Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times This project was supported by the National Natural Science Foundation of China (70631003) and the Hefei University of Technology Foundation (071102F). Journal of Systems Engineering and Electronics. 2008 8月;19(4):827-834. doi: 10.1016/S1004-4132(08)60160-7