Scholarlink

Most of the researchers concentrated to solve single objective flowshop scheduling problems. But the real-life situation, demands more than one objective. In this article, Flower Pollination Optimization Algorithm is proposed to reduce Makespan, Total Flow Time, and Machine Idle Time combinedly with equal weight factor, so that total production amount is optimized and resource are utilized efficiently. Experimental results exhibit that Flower Pollination Optimization Algorithm is tested with various size Taillard benchmark problems.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Application of Flower Pollination Algorithm to Multi-objective Flowshop Sequencing and Scheduling Problems

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • R. Sanjeev Kumar,
  • G. Mohan Kumar,
  • S. Mythili,
  • M. Rajkumar,
  • T. Ayyappan

摘要

Most of the researchers concentrated to solve single objective flowshop scheduling problems. But the real-life situation, demands more than one objective. In this article, Flower Pollination Optimization Algorithm is proposed to reduce Makespan, Total Flow Time, and Machine Idle Time combinedly with equal weight factor, so that total production amount is optimized and resource are utilized efficiently. Experimental results exhibit that Flower Pollination Optimization Algorithm is tested with various size Taillard benchmark problems.