Bicriteria in a two-stage flowshop scheduling problem

被引:0
|
作者
Bagga, PC
Bhambani, A
机构
[1] Univ Delhi, Moti Lal Nehru Coll E, Delhi 110007, India
[2] Univ Delhi, Jesus & Mary Coll, Delhi 110007, India
来源
关键词
scheduling; sequencing; optimization; flowshop;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This paper proposes a simple and direct procedure for obtaining a sequence which minimizes total flowtime subject to minimum makespan in a two-stage flowshop scheduling problem.
引用
收藏
页码:1475 / 1481
页数:7
相关论文
共 50 条