当前位置:
X-MOL 学术
›
Eng. Optim.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
Engineering Optimization ( IF 2.7 ) Pub Date : 2020-08-27 , DOI: 10.1080/0305215x.2020.1796999 Harun Aydilek 1 , Asiye Aydilek 2 , Ali Allahverdi 3
Engineering Optimization ( IF 2.7 ) Pub Date : 2020-08-27 , DOI: 10.1080/0305215x.2020.1796999 Harun Aydilek 1 , Asiye Aydilek 2 , Ali Allahverdi 3
Affiliation
The two-machine flowshop scheduling problem to minimize total completion time with separate set-up times is addressed. Set-up times are modelled as uncertain within an interval where only the lower...
中文翻译:
在具有不确定设置时间的两机流水车间问题中最小化总完成时间的算法
解决了两机流水车间调度问题,以最小化总完成时间与单独的设置时间。设置时间在一个区间内被建模为不确定,其中只有较低的...
更新日期:2020-08-27
中文翻译:
在具有不确定设置时间的两机流水车间问题中最小化总完成时间的算法
解决了两机流水车间调度问题,以最小化总完成时间与单独的设置时间。设置时间在一个区间内被建模为不确定,其中只有较低的...