Abstract
In many industrial and computing applications, proper scheduling of tasks can determine the overall efficiency of the system. The algorithm, presented in this paper, tackles the scheduling problem in a multi-layer multiprocessor environment, which exists in many computing and industrial applications. Based on the scheduling terminology, the problem can be defined as multiprocessor task scheduling in hybrid flow-shops. This paper presents a particle swarm optimization algorithm for the solution and reports its performance. The results are compared with other well known meta-heuristic techniques proposed for the solution of the same problem. Our results show that particle swarm optimization has merits in solving multiprocessor task scheduling in a hybrid flow-shop environment.
Keywords
- Particle Swarm Optimization
- Schedule Problem
- Completion Time
- Tabu Search
- Particle Swarm Optimization Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Caraffa, V., Ianes, S., Bagchi, T.P., Sriskandarajah, C.: Minimizing Make-Span in Blocking Flow-Shop Using Genetic Algorithms. International Journal of Production Economics 70, 101–115 (2001)
Chan, J., Lee, C.Y.: General Multiprocessor Task Scheduling. Naval Research Logistics 46, 57–74 (1999)
Drozdowski, M.: Scheduling Multiprocessor Tasks - An Overview. European Journal of Operational Research 94, 215–230 (1996)
Ercan, M.F., Fung, Y.F.: The Design and Evaluation of a Multiprocessor System for Computer Vision. Microprocessors and Microsystems 24, 365–377 (2000)
Ercan, M.F., Oğuz, C.P: Performance of Local Search Heuristics on Scheduling a Class of Pipelined Multiprocessor Tasks. Computers and Electrical Engineering 31, 537–555 (2005)
Garey, E.L., Johnson, D.S., Sethi, R.: The Complexity of Flow-shop and Job-shop Scheduling. Math. Operations Research 1, 117–129 (1976)
Goldberg, D., Lingle, R.: Alleles, Loci, and the Traveling Salesman Problem. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 154–159 (1985)
Gupta, J.N.D, Hariri, A.M.A., Potts, C.N: Schedules for a Two-stage Hybrid Flow-shop with Parallel Machines at First Stage. Ann. Oper. Res. Soc. 69, 171–191 (1997)
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of IEEE Int. Conf. on Neural Network, pp. 1942–1948 (1995)
Kennedy, J.: The Particle Swarm: Social Adaptation of Knowledge. In: Proceedings of IEEE Int. Conf. on Evolutionary Computation, pp. 303–308 (1997)
Krawczyk, H., Kubale, M.: An Approximation Algorithm for Diagnostic Test Scheduling in Multi-computer Systems. IEEE Trans. Computers 34(9), 869–872 (1985)
Lee, C.Y., Cai, X.: Scheduling One and Two-processors Tasks on Two Parallel Processors. IIE Transactions 31, 445–455 (1999)
Linn, R., Zhang, W.: Hybrid Flow-Shop Schedule: A Survey. Computers and Industrial Engineering 37, 57–61 (1999)
Oğuz, C., Ercan, M.F., Cheng, T.C.E., Fung, Y.F.: Heuristic Algorithms for Multiprocessor Task Scheduling in a Two Stage Hybrid Flow Shop. European Journal of Operations Research 149, 390–403 (2003)
Oğuz, C., Zinder, Y., Do, V., Janiak, A., Lichtenstein, M.: Hybrid Flow-Shop Scheduling Problems with Multiprocessor Task Systems. European Journal of Operations Research 152, 115–131 (2004)
Oğuz, C., Ercan, M.F.: A Genetic Algorithm for Hybrid Flow-Shop Scheduling with Multiprocessor Tasks. Journal of Scheduling 8, 323–351 (2005)
Scala, M.L., Bose, A., Tylavsky, J., Chai, J.S.: A Highly Parallel Method for Transient Stability Analysis. IEEE Transactions on Power Systems 5, 1439–1446 (1990)
Sivrikaya-Serifoglu, F., Tiryaki, I.U.: Multiprocessor Task Scheduling in Multistage Hybrid Flow-Shops: A Simulated Annealing Approach. In: Proceedings of 2nd Int. Conf. on Responsive Manufacturing, pp. 270–274 (2002)
Ying, K.C, Lin, S.W.: Multiprocessor Task Scheduling in Multistage Hybrid Flow-Shops: an Ant Colony System Approach. International Journal of Production Research 44, 3161–3177 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ercan, M.F., Fung, YF. (2007). Performance of Particle Swarm Optimization in Scheduling Hybrid Flow-Shops with Multiprocessor Tasks. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74484-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-74484-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74482-5
Online ISBN: 978-3-540-74484-9
eBook Packages: Computer ScienceComputer Science (R0)