Solving Single Machine Total Weighted Tardiness Problem with Unequal Release Date Using Neurohybrid Particle Swarm Optimization Approach
Authors:
Open Access
- 23 June 2015
- journal article
- research article
- Published by Hindawi Limited in Computational Intelligence and Neuroscience
- Vol. 2015, 1-13
Abstract
A particle swarm optimization algorithm (PSO) has been used to solve the single machine total weighted tardiness problem (SMTWT) with unequal release date. To find the best solutions three different solution approaches have been used. To prepare subhybrid solution system, genetic algorithms (GA) and simulated annealing (SA) have been used. In the subhybrid system (GA and SA), GA obtains a solution in any stage, that solution is taken by SA and used as an initial solution. When SA finds better solution than this solution, it stops working and gives this solution to GA again. After GA finishes working the obtained solution is given to PSO. PSO searches for better solution than this solution. Later it again sends the obtained solution to GA. Three different solution systems worked together. Neurohybrid system uses PSO as the main optimizer and SA and GA have been used as local search tools. For each stage, local optimizers are used to perform exploitation to the best particle. In addition to local search tools, neurodominance rule (NDR) has been used to improve performance of last solution of hybrid-PSO system. NDR checked sequential jobs according to total weighted tardiness factor. All system is named as neurohybrid-PSO solution system.Keywords
This publication has 30 references indexed in Scilit:
- Single machine scheduling with unequal release date using neuro-dominance ruleJournal of Intelligent Manufacturing, 2009
- A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release timesEngineering Optimization, 2009
- A new dominance rule to minimize total weighted tardiness with unequal release datesEuropean Journal of Operational Research, 2001
- A survey of algorithms for the single machine total weighted tardiness scheduling problemDiscrete Applied Mathematics, 1990
- A Heuristic Solution Procedure to Minimize T on a Single MachineJournal of the Operational Research Society, 1989
- A Branch and Bound Algorithm for the Total Weighted Tardiness ProblemOperations Research, 1985
- Dynamic Programming Solution of Sequencing Problems with Precedence ConstraintsOperations Research, 1978
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related TasksOperations Research, 1978
- Minimizing Total Costs in One-Machine SchedulingOperations Research, 1975
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962