Theme-Logo
  • Login
  • Home
  • Course
  • Publication
  • Theses
  • Reports
  • Published books
  • Workshops / Conferences
  • Supervised PhD
  • Supervised MSc
  • Supervised projects
  • Education
  • Language skills
  • Positions
  • Memberships and awards
  • Committees
  • Experience
  • Scientific activites
  • In links
  • Outgoinglinks
  • News
  • Gallery
publication name Hybrid Particle SWARM Optimization for Solving Machine Time Scheduling Problem
Authors A. A. El-sawy; A. A. Tharwat
year 2013
keywords Machine Time Scheduling, Particle SWARM optimization, Genetic Algorithm, Mutation, Crossover, Time Window
journal International Journal of Computer and Information Technology
volume 02
issue 03
pages 364-375
publisher Not Available
Local/International International
Paper Link http://www.ijcit.com/Vol2Issue3.php
Full paper download
Supplementary materials Not Available
Abstract

A hybrid particle swarm optimization (PSO) for multi-machine time scheduling problem (MTSP) with multicycles is proposed in this paper to choose the best starting time for each machine in each cycle under pre-described time window and a set of precedence machines for each machine; to minimize the total penalty cost. We developed hybrid algorithm by using a combination between PSO and Genetic Algorithms (GA), precisely the GA operators’ crossover and mutation. Based on experimental results for the developed hybrid algorithms, we can conclude that, the algorithm that combines PSO with mutation gives best solution for MTSP.

Benha University © 2023 Designed and developed by portal team - Benha University