机译:有效的启发式方法,可解决具有最大和最小时间滞后的非置换流水车间调度问题
School of Mechanical Engineering, University of Science and Technology Beijing, Xueyuan Road 30, Haidian District, Beijing 100083, PR China;
School of Mechanical Engineering, University of Science and Technology Beijing, Xueyuan Road 30, Haidian District, Beijing 100083, PR China;
School of Mechanical Engineering, University of Science and Technology Beijing, Xueyuan Road 30, Haidian District, Beijing 100083, PR China;
School of Mechanical Engineering, University of Science and Technology Beijing, Xueyuan Road 30, Haidian District, Beijing 100083, PR China;
Non-permutation; Flow shop; Time lags; Makespan; Iterated greedy algorithm;
机译:具有最小和最大时间滞后的非置换Flowshop调度问题:理论研究和启发式
机译:具有最小和最大时间延迟的多模式资源受限项目调度问题的实用且鲁棒的执行时间框架程序
机译:以最小和最大的时间滞后最小化置换Flowshop调度问题中的总拖延
机译:基于遗传算法的启发式算法,用于最小化总加权完成时间的非置换两机机器人流水车间调度问题
机译:开发具有资源约束和转换注意事项的生产调度的省时启发式方法。
机译:minmax的启发式算法使处理时间间隔为间隔的流水车间问题后悔
机译:具有最小和最大时滞的资源受限项目计划的启发式方法和应用