Parallel Test Task Scheduling with Constraints Based on Hybrid Particle Swarm Optimization and Taboo Search

Article Contents

Article Navigation > Chinese Journal of Electronics > 2012 > 21(4): 615-618

“Parallel Test Task Scheduling with Constraints Based on Hybrid Particle Swarm Optimization and Taboo Search,” Chinese Journal of Electronics, vol. 21, no. 4, pp. 615-618, 2012,

Citation:

“Parallel Test Task Scheduling with Constraints Based on Hybrid Particle Swarm Optimization and Taboo Search,” Chinese Journal of Electronics, vol. 21, no. 4, pp. 615-618, 2012,

“Parallel Test Task Scheduling with Constraints Based on Hybrid Particle Swarm Optimization and Taboo Search,” Chinese Journal of Electronics, vol. 21, no. 4, pp. 615-618, 2012,

Citation:

“Parallel Test Task Scheduling with Constraints Based on Hybrid Particle Swarm Optimization and Taboo Search,” Chinese Journal of Electronics, vol. 21, no. 4, pp. 615-618, 2012,

PDF( 248 KB)

Parallel Test Task Scheduling with Constraints Based on Hybrid Particle Swarm Optimization and Taboo Search

Received Date: 2011-09-01
Rev Recd Date: 2012-03-01
Publish Date: 2012-10-25

Abstract

Abstract

Parallel test task scheduling is one of the key technologies used in parallel test. A hybrid Particle swarm optimization and Taboo search algorithm (PSO-TS) is proposed to solve parallel test task scheduling with constraints. The scheduling process is divided into two subproblems: task scheduling sequence with constraints and resource optimization. Under the view, the test resource scheduling problem can be solved after the task scheduling with constraints. This can improve the optimization rate of PSO-TS. What is more, a new inertia weight is proposed to enhance exploitation and exploration ability and a new constraint-handling mechanism is used to code during the particle updating for the test task scheduling problem. Simulation results show the suitability of the proposed algorithm in terms of feasibility and effectiveness.

FullText(HTML)

References(14)

References

http://softwareqatestings.com/software-test-types/paralleltesting.html.

A. Radulescu, C. Nicolescu, van Gemund, A.J.C., Jonker, P.P.“CPR: Mixed task and data parallel scheduling for distributedsystems”, Parallel and Distributed Processing Symposium, Proceedings15th International, San Francisco, CA, USA, pp.1-9,2001.

Nathan Waivio, “Parallel test description and analysis of paralleltest system speedup through amdahl’s low”, IEEE Autotestcon,Baltimore, MD, pp.735-740, 2007.

Xia Rui, Xiao Mingqing, Cheng Jinjun, Fu Xinhua, “Optimizingthe multi-UUT parallel test task scheduling based onmulti-objective GASA”, IEEE 8th International Conference onElectronic Measurement and Instruments, Xi’an, Chinese, pp.4-839-4-844, 2007.

Zohar Laslo, Baruch Keren, Hagai Ilani, “Minimizing task completiontime with the execution set method”, European Journalof Operational Research, Vol.187, No.3, pp.1513-1519, 2008.

Lukasz Kuszner, Michal Malafiejski, “A polynomial algorithmfor some preemptive multiprocessor task scheduling problems”,European Journal of Operational Research, Vol.176, pp.145-150, 2007.

Jiayong Fang, Huihui Xue, Mingqing Xiao, “Parallel test tasksscheduling and resources configuration based on GA-ACA”,Journal of Measurement Science and Instrumentation, Vol.2,No.4, pp.321-326, 2011.

Yang Meng, A.E.A. Almaini, Wang Pengjun, “FPGA placementoptimization by two-step unified genetic algorithm andsimulated annealing algorithm”, Journal of Electric (China),Vol.23, No.4, pp.632-636, 2006.

J. Kennedy, R.C. Eberhart, “Particle swarm optimization”,Proc. IEEE International Conference on Neural Networks,Perth, WA, Vol.4, pp.1942-1948, 1995.

J. Kennedy, R.C. Everhart, “A discrete binary of the particleswarm algorithm”, Proc. IEEE International Conference onSystems, Man, and Cybernetics, pp.4104-4109, 1997.

Y. Shi and R. Eberhart, “A modified particle swarm optimizer”,IEEE International Conference on Evolutionary ComputationProceedings, Anchorage, AK, USA, pp.69-73, 1998.

J. Kennedy, “Small world and mega-minds: effects of neighborhoodtopologies on particle swarm performance”, Congress onEvolutionary Computation, Washington, DC, USA, pp.1931-1938, 1999.

Fred Glover, “Taboo search-Part I”, ORSA Journal on Computing,Vol.1, No.3, pp.190-206, 1989.

Fred Glover, “Taboo search-Part II”, ORSA Journal on Computing,Vol.2, No.1, pp.4-32, 1990.

Relative Articles

Supplements(0)

Cited By

Proportional views