首页> 外文期刊>Mathematics and Statistics >Hybrid Flow-Shop Scheduling (HFS) Problem Solving with Migrating Birds Optimization (MBO) Algorithm
【24h】

Hybrid Flow-Shop Scheduling (HFS) Problem Solving with Migrating Birds Optimization (MBO) Algorithm

机译:用迁移鸟类优化(MBO)算法解决混合流量店调度(HFS)问题解决

获取原文
       

摘要

The development of an increasingly rapid industrial development resulted in increasingly intense competition between industries. Companies are required to maximize performance in various fields, especially by meeting customer demand with agreed timeliness. Scheduling is the allocation of resources to the time to produce a collection of jobs. PT. Bella Agung Citra Mandiri is a manufacturing company engaged in making spring beds. The work stations in the company consist of 5 stages consisting of ram per with three machines, clamps per 1 machine, firing mattresses with two machines, sewing mattresses three machines and packing with one machine. The model problem that was solved in this study was Hybrid Flowshop Scheduling. The optimization method for solving problems is to use the metaheuristic method Migrating Birds Optimization. To avoid problems faced by the company, scheduling is needed to minimize makespan by paying attention to the number of parallel machines. The results of this study are scheduling for 16 jobs and 46 jobs. Decreasing makespan value for 16 jobs minimizes the time for 26 minutes 39 seconds, while for 46 jobs can minimize the time for 3 hours 31 minutes 39 seconds.
机译:发展越来越快速的工业发展导致行业之间越来越强烈的竞争。公司需要最大化各个领域的性能,特别是通过同意的及时性满足客户需求。调度是生成作业集合的时间的资源分配。 Pt。 Bella Agung Citra Mandiri是一家从事春床的制造公司。公司中的工作站由5个阶段组成,由3台机器组成,每1台机器夹具,用两台机器射击床垫,缝制床垫三台机器和一台机器包装。本研究中解决的模型问题是混合流动的调度。解决问题的优化方法是使用迁移鸟类优化的成逐方法。为避免公司面临的问题,需要调度,以通过关注并联机器的数量来最大限度地减少Mapespan。本研究的结果正在安排16个就业和46个工作岗位。减少16个作业的MakEspan值最小化26分钟39秒的时间,而46个工作可以最小化3小时31分钟39秒的时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号