机译:两个元启发式算法,用于安排与后期工作标准的无关机器
School of Electronics and Information Engineering Liaoning University of Technology Shiying 169 121001 Jinzhou China Institute of Computing Science Poznan University of Technology ul. Piotrowo 3a 60-965 Poznan Poland;
School of Electronics and Information Engineering Liaoning University of Technology Shiying 169 121001 Jinzhou China;
Institute of Computing Science Poznan University of Technology ul. Piotrowo 3a 60-965 Poznan Poland;
Institute of Computing Science Poznan University of Technology ul. Piotrowo 3a 60-965 Poznan Poland Institute of Bioorganic Chemistry Polish Academy of Sciences ul. Noskowskiego 12 61-704 Poznan Poland;
late work minimization; unrelated machines; tabu search; genetic algorithm;
机译:心脏:使用启发式和元识别算法的云计算任务调度的优先约束不相关的并联机器问题
机译:具有返工流程和机器资格限制的不相关并行机器调度问题的鲁棒元启发式实现
机译:无关机器的求解算法minmax会后悔具有间隔处理时间和总流动时间准则的调度问题
机译:具有机器资格约束的无关并行机在线调度的启发式和元启发式算法
机译:无关的并行机器调度,具有与序列有关的设置时间和机器合格限制,可最大程度地缩短制造周期。
机译:具有加权后期工作准则和共同到期日的并行同机调度问题的元启发式算法
机译:具有加权后期工作准则和共同到期日的并行同机调度问题的元启发式算法