Particle swarm optimization algorithm for single machine total weighted tardiness problem
- 17 January 2005
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art surveyInternational Journal of Production Economics, 2002
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing, 2002
- A particle swarm optimization for reactive power and voltage control considering voltage security assessmentIEEE Transactions on Power Systems, 2000
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing, 1998
- A computational experiment of covert-AU class of rules for single machine tardiness scheduling problemComputers & Industrial Engineering, 1996
- Single Machine Tardiness Sequencing HeuristicsIIE Transactions, 1991
- A controlled search simulated annealing method for the single machine weighted tardiness problemAnnals of Operations Research, 1989
- A Branch and Bound Algorithm for the Total Weighted Tardiness ProblemOperations Research, 1985
- Minimizing Total Costs in One-Machine SchedulingOperations Research, 1975
- One-Machine Sequencing to Minimize Certain Functions of Job TardinessOperations Research, 1969