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

被引：53
作者：
Li, Kai [1 ]
Yang, Shan-Lin [1 ]
机构：
[1] Hefei Univ Technol, Sch Management, Hefei 230009, Peoples R China
来源：
APPLIED MATHEMATICAL MODELLING | 2009年 / 33卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Parallel-machine scheduling; Total weighted completion time; Model; Relaxation; Algorithm; OF-THE-ART; FLOW TIME; SINGLE-MACHINE; APPROXIMATION ALGORITHMS; TARDINESS PENALTIES; RELEASE DATES; TABU SEARCH; JOBS; BOUNDS; PROCESSORS;
D O I：
10.1016/j.apm.2008.05.019
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
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 Copyright (C) 2008 Published by Elsevier Inc. All rights reserved.
引用
收藏
页码：2145 / 2158
页数：14
相关论文
共 81 条
[1]   A review of scheduling research involving setup considerations [J].
Allahverdi, A ;
Gupta, JND ;
Aldowaisan, T .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (02) :219-239
[2]  
[Anonymous], P 40 ANN IEEE S FDN
[3]  
[Anonymous], SOV MATH DOKL
[4]   Use of genetic algorithms to solve production and operations management problems: a review [J].
Aytug, H ;
Khouja, M ;
Vergara, FE .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2003, 41 (17) :3955-4009
[5]   On the minimization of total weighted flow time with identical and uniform parallel machines [J].
Azizoglu, M ;
Kirca, O .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 113 (01) :91-100
[6]  
Azizoglu M, 1999, IIE TRANS, V31, P153, DOI 10.1023/A:1007516602473
[7]   SCHEDULING WITH PARALLEL PROCESSORS AND LINEAR DELAY COSTS [J].
BAKER, KR ;
MERTEN, AG .
NAVAL RESEARCH LOGISTICS, 1973, 20 (04) :793-804
[8]   SEQUENCING WITH EARLINESS AND TARDINESS PENALTIES - A REVIEW [J].
BAKER, KR ;
SCUDDER, GD .
OPERATIONS RESEARCH, 1990, 38 (01) :22-36
[9]   Early/tardy scheduling with sequence dependent setups on uniform parallel machines [J].
Balakrishnan, N ;
Kanet, JJ ;
Sridharan, V .
COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (02) :127-141
[10]   A branch and bound to minimize the number of late jobs on a single machine with release time constraints [J].
Baptiste, Philippe ;
Peridy, Laurent ;
Pinson, Eric .
European Journal of Operational Research, 2003, 144 (01) :1-11
123456789