首页> 外文OA文献 >An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan

【2h】

An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan

机译：具有不兼容作业族的单并行批量机器调度的最佳在线算法，可最大程度地缩短制造时间

页面导航

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

摘要

We consider the online scheduling of incompatible job families on an unbounded parallel-batch machine to minimize the makespan, where jobs arrive over time and the number of job families, f, is known in advance. We provide an optimal online algorithm for the problem with a competitive ratio of 1+4 f2+1-12f.

机译：我们考虑在无限制的并行批处理计算机上在线调度不兼容的作业族，以最大程度地缩短工期，在该范围内作业随时间到达，并且预先知道作业族的数量f。我们提供具有1 + 4 f2 + 1-12f竞争比的最优在线算法。

著录项

作者
Fu R; Cheng TCE; Ng CT; Yuan J;
展开▼
作者单位

展开▼
年度 2013
总页数
原文格式 PDF
正文语种 eng
中图分类

相似文献

外文文献
中文文献
专利

1. An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan [J] . Fu R., Cheng T.C.E., Ng C.T., Operations Research Letters: A Journal of the Operations Research Society of America . 2013,第3期

机译：具有不兼容作业族的单并行批量机器调度的最佳在线算法，可最大程度地缩短制造时间
2. SCHEDULING FAMILY JOBS ON AN UNBOUNDED PARALLEL-BATCH MACHINE TO MINIMIZE MAKESPAN AND MAXIMUM FLOW TIME [J] . Geng Zhichao, Yuan Jinjiang Journal of industrial and management optimization . 2018,第4期

机译：在无边界的并行批量计算机上安排家庭作业，以最大程度地减少制作跨度和最长的流程时间
3. SCHEDULING FAMILY JOBS ON AN UNBOUNDED PARALLEL-BATCH MACHINE TO MINIMIZE MAKESPAN AND MAXIMUM FLOW TIME [J] . Geng Zhichao, Yuan Jinjiang Journal of industrial and management optimization . 2018,第4期

机译：在无边界的并行批量计算机上安排家庭作业，以最大程度地减少制作跨度和最长的流程时间
4. The Bounded Single-Machine Parallel-batching Scheduling Problem with Family Jobs for Minimizing Makespan [C] . Jintao Meng, Xiaoxu Lu International Conference on Environmental Science and Information Application Technology . 2013

机译：用于最小化MakEspan的家庭工作的有界单机并行批处理调度问题
5. Heuristic approaches to minimize the makespan and tardiness: Scheduling jobs with job splitting property on uniform parallel machines with different capacities. [D] . Shetty, Punit N. 2015

机译：启发式方法，最大程度地减少了工期和拖延时间：在具有不同容量的统一并行计算机上调度具有作业拆分属性的作业。
6. MIP Models and Hybrid Algorithms for Simultaneous Job Splitting and Scheduling on Unrelated Parallel Machines [O] . Duygu Yilmaz Eroglu, H. Cenk Ozmutlu -1

机译：在无关并行机上同时进行作业分割和调度的MIP模型和混合算法
7. An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan [O] . Fu R, Cheng TCE, Ng CT, 2013

机译：具有不兼容作业族的单并行批量机器调度的最佳在线算法，可最大程度地缩短制造周期

An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan

摘要

著录项

相似文献

相关主题

期刊订阅