flowshop;
scheduling;
assembly type production;
algorithm;
makespan;
D O I:
暂无
中图分类号:
O223 [统筹方法];
学科分类号:
070105 ;
1201 ;
摘要:
An assembly type flowshop scheduling problem with minimizing makespan is considered in this paper. The problem of scheduling for minimizing makespan is first addressed, and then a new heuristic algorithm is proposed for it.
机构:
Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531
Morizawa, Kazuko
Sun, Xi
论文数: 0引用数: 0
h-index: 0
机构:
Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531
Sun, Xi
Nagasawa, Hiroyuki
论文数: 0引用数: 0
h-index: 0
机构:
Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531
机构:
Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531
Morizawa, Kazuko
Sun, Xi
论文数: 0引用数: 0
h-index: 0
机构:
Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531
Sun, Xi
Nagasawa, Hiroyuki
论文数: 0引用数: 0
h-index: 0
机构:
Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531Department of Industrial Engineering, Graduate School of Engineering, Osaka Prefecture University, Sakai Osaka, 599-8531