A NEW APPROXIMATION ALGORITHM FOR THE NONPREEMPTIVE SCHEDULING OF INDEPENDENT JOBS ON IDENTICAL PARALLEL PROCESSORS

GIUSEPPE PALETTA; PAOLAMARIA PIETRAMALA

首页> 外文期刊>SIAM Journal on Discrete Mathematics >A NEW APPROXIMATION ALGORITHM FOR THE NONPREEMPTIVE SCHEDULING OF INDEPENDENT JOBS ON IDENTICAL PARALLEL PROCESSORS

【24h】

A NEW APPROXIMATION ALGORITHM FOR THE NONPREEMPTIVE SCHEDULING OF INDEPENDENT JOBS ON IDENTICAL PARALLEL PROCESSORS

机译：并行处理器独立作业非优先排序的一种新的近似算法。

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

We consider the scheduling problem of n independent jobs on m identical parallel processors in order to minimize makespan, the completion time of the last job. We propose a new approximation algorithm that iteratively combines partial solutions to the pro

机译：我们考虑在m个相同的并行处理器上进行n个独立作业的调度问题，以最小化制造期（最后一个作业的完成时间）。我们提出了一种新的近似算法，该算法将部分解迭代地组合到了

著录项

来源
《SIAM Journal on Discrete Mathematics》 |2008年第2期|p.313-328|共16页
作者
GIUSEPPE PALETTA; PAOLAMARIA PIETRAMALA;
展开▼
作者单位

Dipartimento di Economia e Statistica, Universita della Calabria, 87036 Arcavacata di Rende, Cosenza, Italy;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类高等数学;
关键词
optimization; scheduling; approximation algorithm; worst-case performance ratio;

机译：优化;调度;近似算法;最坏情况下的性能比;

相似文献

外文文献
中文文献
专利

1. Improved approximation algorithms for scheduling parallel jobs on identical clusters [J] . Bougeret Marin, Dutot Pierre-Francois, Trystram Denis, Theoretical computer science . 2015,第Null期

机译：改进的近似算法，用于在相同集群上调度并行作业
2. Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time [J] . Baptiste P, Timkovsky VG Mathematical methods of operations research . 2004,第1期

机译：在两台相同的并行计算机上获得非抢占式单位作业时间表的最短路径，而总完成时间却最短
3. Approximation algorithms for the min-max regret identical parallel machine scheduling problem with outsourcing and uncertain processing time [J] . Wang Shijin, Cui Wenli International Journal of Production Research . 2021,第15a16期

机译：MIN-MAX后悔的近似算法与外包和不确定处理时间相同的并联机器调度问题
4. Efficient Heuristic Solution Methodologies for Scheduling Batch Processor with Incompatible Job-Families, Non-identical Job-Sizes and Non-identical Job-Dimensions [C] . M. Mathirajan, M. Ramasubramanian IFIP WG 5.7 international conference on advances in production management systems . 2019

机译：有效的启发式解决方案方法，用于调度具有不兼容的工作族，不相同的工作规模和不相同的工作维度的批处理处理器
5. Algorithms for scheduling parallel batch processing machines with non-identical job ready times. [D] . Velez Gallego, Mario Cesar. 2009

机译：用于调度具有不同作业准备时间的并行批处理机器的算法。
6. Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines [O] . Guang-Qian Zhang, Jian-Jun Wang, Ya-Jing Liu -1

机译：在不相关的并行机上调度具有可变作业处理时间的作业
7. Improved approximation algorithms for scheduling parallel jobs on identical clusters [O] . Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, 2015

机译：改进近似算法，用于调度相同群集上的并行作业

A NEW APPROXIMATION ALGORITHM FOR THE NONPREEMPTIVE SCHEDULING OF INDEPENDENT JOBS ON IDENTICAL PARALLEL PROCESSORS

摘要

著录项

相似文献

相关主题

期刊订阅