...
机译:一种启发式算法,可最大程度减少置换流程车间中作业的总流程时间
Department of Mechanical Engineering, Krishnasamy College of Engineering and Technology, Cuddalore 607 109, Tamilnadu, India;
Department of Manufacturing Engineering, Annamalai University, Annamalai Nagar 608 002, Tamilnadu, India;
Department of Management Studies, Indian Institute of Technology Madras, Chennai 600 036, Tamilnadu, India;
Sasurie Academy of Engineering, Coimbatore 641 653, Tamilnadu, India;
scheduling; permutation flowshop; total flowtime; TFT; heuristic algorithm;
机译:最佳调度算法,以最大限度地减少双机置换流程的总流量时间,等待时间有限,准备好的作业
机译:蚁群算法用于置换Flowshop调度,以最大程度减少作业的制造时间/总流动时间
机译:双标准改进的遗传算法,用于在流水车间进行调度,以最大程度地减少工期和总作业时间
机译:总流程时间最小化的置换Flowshop调度问题的组合启发式算法
机译:置换Flowshop调度启发式
机译:通过深度加强学习来调度动态排列流程的智能决策
机译:置换流量流动时间最小化启发式的比较