...
机译:一种BB&R算法,可最大程度地减少一台机器上的总拖延时间,其顺序取决于设置时间
Department of Mathematics and Statistics, Southern Illinois University Edwardsville, Edwardsville, 1L 62026, USA;
Department of Computer Science, University of Illinois at Urbana-Champaign, 201 North Goodwin Ave. (MC-258), Urbana, IL 61801-2302, USA;
Department of Computer Science, University of Illinois at Urbana-Champaign, 201 North Goodwin Ave. (MC-258), Urbana, IL 61801-2302, USA;
Department of Computer Science, University of Illinois at Urbana-Champaign, 201 North Goodwin Ave. (MC-258), Urbana, IL 61801-2302, USA;
Sandia National Laboratories, P.O. Box 5800, MS 1188, Albuquerque, NM 87185-1188, USA;
branch and bound algorithms; scheduling theory and algorithms; dynamic programming; dominance rules;
机译:单机调度的分支定界算法,其序列依赖的设置时间可最大程度地减少总延迟
机译:迭代本地搜索,用于单机调度,其序列依赖的设置时间可最大程度地减少总加权拖延
机译:变量邻域搜索,用于在单个机器上通过与序列相关的设置时间来最大程度地减少总加权拖尾
机译:单机调度可最大程度地减少延迟,并根据顺序设置设置时间完成工作时间
机译:启发式算法,可最大程度地降低单机和相同并行机上的总加权拖尾率,并具有与序列相关的设置和未来准备时间
机译:具有序列依赖建立时间和学习效果的多目标单机群调度问题的混合帕累托人工蜂群算法
机译:ILS HeuRistics为单机调度问题与序列相关的家庭设置时间以最小化总衰退