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 条
[11]  
Barnes J. W., 1977, AIIE Transactions, V9, P25, DOI 10.1080/05695557708975117
[12]   SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH [J].
BARNES, JW ;
LAGUNA, M .
IIE TRANSACTIONS, 1993, 25 (02) :121-128
[13]   SCHEDULING WITH RELEASE DATES ON A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME [J].
BELOUADAH, H ;
POSNER, ME ;
POTTS, CN .
DISCRETE APPLIED MATHEMATICS, 1992, 36 (03) :213-231
[14]   SCHEDULING IDENTICAL PARALLEL MACHINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME [J].
BELOUADAH, H ;
POTTS, CN .
DISCRETE APPLIED MATHEMATICS, 1994, 48 (03) :201-218
[15]   MATHEMATICAL-PROGRAMMING FORMULATIONS FOR MACHINE SCHEDULING - A SURVEY [J].
BLAZEWICZ, J ;
DROR, M ;
WEGLARZ, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 51 (03) :283-300
[16]   Metaheuristics in combinatorial optimization: Overview and conceptual comparison [J].
Blum, C ;
Roli, A .
ACM COMPUTING SURVEYS, 2003, 35 (03) :268-308
[17]  
Brown Donald E., 1995, Intelligent Scheduling Systems
[18]   Tabu search algorithms for cyclic machine scheduling problems [J].
Brucker, P ;
Kampmeyer, T .
JOURNAL OF SCHEDULING, 2005, 8 (04) :303-322
[19]  
BRUCKER P, 2004, COMPLEXITY MEAN FLOW
[20]   SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].
BRUNO, J ;
COFFMAN, EG ;
SETHI, R .
COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387
123456789