Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms
Authors:
- Kai LiKLKai Li
- Shan-Lin YangSYShan-Lin Yang
- 1 April 2009
- journal article
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 33 (4) , 2145-2158
Abstract
No abstract availableKeywords
This publication has 71 references indexed in Scilit:
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003
- Convex quadratic and semidefinite programming relaxations in schedulingJournal of the ACM, 2001
- Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisonsIEEE Transactions on Evolutionary Computation, 2000
- Scheduling on uniform parallel machines to minimize maximum latenessOperations Research Letters, 2000
- Approximation in stochastic schedulingJournal of the ACM, 1999
- SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCHIIE Transactions, 1993
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow ShopsJournal of Algorithms, 1993
- Preemptive scheduling to minimize mean weighted flow timeInformation Processing Letters, 1990
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtimeInternational Journal of Production Research, 1988
- Scheduling with parallel processors and linear delay costsNaval Research Logistics Quarterly, 1973