首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:A New Combined Approach for Optimizing Makespan in Job Shop Scheduling Problem
  • 本地全文:下载
  • 作者:S. Sureshkumar ; Dr.S.Thiruvenkadam
  • 期刊名称:International Journal of Innovative Research in Science, Engineering and Technology
  • 印刷版ISSN:2347-6710
  • 电子版ISSN:2319-8753
  • 出版年度:2015
  • 卷号:4
  • 期号:12
  • 页码:11830
  • DOI:10.15680/IJIRSET.2015.0412024
  • 出版社:S&S Publications
  • 摘要:Scheduling is the most important issue to be solved in the real time environment. One such emerging problem in the scheduling is the job shop scheduling problem, applied in various fields of engineering. Recently many works have been reported to reduce the makespan time in JSP. No Scheduling technique has guaranteed optimality. This paper aims at providing a well optimized scheduling technique, reducing the makespan based on precedence and capacity constraints allo wing a machine to process almost one operation at a time. This paper proposed a Genetic algorithm with unordered subsequence Exchange cross-over (USXX) and H ybrid approach called a PSO-GA. The proposed algorithm is examined by using a set of benchmark instances with various sizes. The hybrid approach produced the better computational time with minimum iterations compare to the other existing algorithms
  • 关键词:Job shop scheduling; Makespan; Genetic algorithm; Particle swarm Optimization.
国家哲学社会科学文献中心版权所有