Lower Bounds for Parallel Machines Scheduling

机译：并行机器调度下限

获取原文

获取外文期刊封面目录资料

页面导航

摘要
著录项
引文网络
相似文献
相关主题

摘要

We present here some new lower bounds for the four following scheduling problems: Pm|r{sub}i|Σw{sub}iT{sub}i, Pm|r{sub}i|ΣT{sub}i, Pm|r{sub}i|Σw{sub}iC{sub}i and Pm|r{sub}i|ΣC{sub}i. This study is theorical and numerical.

机译：我们在这里介绍四个调度问题的一些新的下限：PM | R {Sub} I |ΣW{Sub} IT {Sub} I，PM | R {Sub} I |ΣT{Sub} I，PM | R {子} I |ΣW{sub} IC {sub} i和pm | r {sub} i |σc{sub} i。这项研究是理论和数值。

著录项

来源
《International Conference on Research, Innovation and Vision for the Future》|2006年||共4页
会议地点
作者
David Savourey; Philippe Baptiste; Antoine Jouglet;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类 TP3-53;
关键词
Scheduling; Lower Bound; Parallel Machines; Total Cost;

机译：调度;下限;平行机;总成本;

相似文献

外文文献
中文文献
专利

1. NEAR-OPTIMAL SOLUTIONS AND TIGHT LOWER BOUNDS FOR THE PARALLEL MACHINES SCHEDULING PROBLEM WITH LEARNING EFFECT [J] . Lotfi Hidri, Mahdi Jemmali RAIRO operations research . 2020,第2期

机译：与学习效果的平行机调度问题的近最佳解决方案和紧密下限
2. An Enhanced tabu search algorithm to minimize a bi-criteria objective inn batching and scheduling problems on unrelated-parallel machines withn desired lower bounds on batch sizes [J] . Shahvari Omid, Logendran Rasaratnam Computers & operations research . 2017,第jana期

机译：增强型禁忌搜索算法，可将不相关的并行机器上的双标准目标旅馆的批处理和调度问题减至最少，并具有所需的批处理下限
3. Pseudo lower bounds for online parallel machine scheduling [J] . Tan Zhiyi, Li Rongqi Operations Research Letters: A Journal of the Operations Research Society of America . 2015,第5期

机译：在线并行机调度的伪下限
4. A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines [C] . Tomas Ebenlendr, Jiri Sgall International workshop on approximation and online algorithms;WAOA 2008 . 2009

机译：在并行机器上立即做出决定的单位作业调度的下界
5. A robust reactive scheduling system with application to parallel machine scheduling. [D] . Arnaout, Jean-Paul M. 2006

机译：强大的反应式调度系统，适用于并行机调度。
6. Tight upper bounds for semi-online scheduling on two uniform machines with known optimum [O] . György Dósa, Armin Fügenschuh, Zhiyi Tan, -1

机译：在已知最佳值的两个统一机器上进行半在线调度的严格上限
7. A lower bound for scheduling of unit jobs with immediate decision on parallel machines [O] . Jiří Sgall et al. 2009

机译：在并行计算机上立即做出决定的单元作业调度的下限
8. Lower Bounds for On-line Single-machine Scheduling; Software engineering rept [R] . Epstein, L., Van Stee, R. 2001

机译：在线单机调度的下限;软件工程部

Lower Bounds for Parallel Machines Scheduling

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅