Dynamic Job Sequencing in Two Parallel Two-Machine Flow Shop

被引：0
作者：
Osman, Mojahid F. Saeed [1 ]
机构：
[1] Amer Univ Sharjah, Dept Ind Engn, Sharjah, U Arab Emirates
来源：
2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM) | 2015年
关键词：
Flow shops; Dynamic sequencing; Parallel Processing; SCHEDULING PROBLEMS; MAKESPAN; HEURISTICS; BENCHMARKS;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper, the case where there are two parallel two-machine flow-shops available to process jobs is considered. We developed a method that creates sequences intended to dynamically minimize the makespan while jobs are added overtime. The solution procedure developed in this research is demonstrated using an illustrative example. The results revealed the effectiveness of the proposed approach for solving dynamic sequencing problem with two parallel two-machine flow-shops.
引用
收藏
页码：485 / 488
页数：4
相关论文
共 50 条
12345