首页> 外文OA文献 >Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds

【2h】

Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds

机译：计划以最小化总加权完成时间：基于LP的启发式算法和下界的性能保证

页面导航

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

著录项

作者
Andreas S. Schulz;
展开▼
作者单位

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

相似文献

外文文献
中文文献
专利

1. Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time [J] . Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos, Optimization methods & software . 2014,第4a6期

机译：在线启发式抢占式单机调度问题，可最大程度减少总加权完成时间
2. Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop [J] . Talel Ladhari, Mohamed Ali Rakrouki International journal of production economics . 2009,第2期

机译：启发式方法和下限，可最大程度地减少两机流水车间中的总完成时间
3. Online bounded-batch scheduling to minimize total weighted completion time on parallel machines [J] . Ran Ma, Long Wan, Lijun Wei, International journal of production economics . 2014,第octa期

机译：在线有边界批处理调度，以最大程度减少并行计算机上的总加权完成时间
4. Branch-and-Bound algorithms to minimize total weighted and total completion time for the dedicated two-processor task scheduling problems P2ixj∑wjCj and P2ixj∑Cj [C] . Adel MANAA, Chengbin CHU, Alice YALAOUI 工业工程与系统管理2007年国际会议（International Conference on Industrial Engineering and Systems Management）（IESM 2007）论文集 . 2007

机译：分支定界算法可最大程度地减少专用两处理器任务调度问题P2 fixj ∑wjCj和P2 fixj ∑Cj的总加权和总完成时间
5. Heuristic Algorithm to Minimize Total Weighted Tardiness on the Unrelated Parallel Machine With Sequence Dependent Setup and Future Ready Time [D] . Li, Tzu Yi 2018

机译：具有序列相关设置和未来准备时间的启发式算法，最小化无关并行机上的总加权拖尾率
6. Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents [O] . Wen-Chiung Lee, Yau-Ren Shiau, Yu-Hsiang Chung, -1

机译：具有两个竞争代理的单机调度可最大程度地减少总完成时间和拖延时间
7. ACCURACY OF A HEURISTIC FOR TOTAL WEIGHTED COMPLETION TIME MINIMIZATION IN PREEMPTIVE SINGLE MACHINE SCHEDULING PROBLEM BY NO IDLE TIME INTERVALS [O] . Vadim V. Romanuke 2019

机译：在抢占式单机调度问题中，抢占完整时间最小化的启发式的准确性没有空闲时间间隔
8. Minimizing Total Weighted Completion Time in a Proportionate Flow Shop [R] . Shakhlevich, N. V., Hoogeveen, J. A., Pinedo, M. 1996

机译：最小化比例流水车间的总加权完成时间

Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds

著录项

引文网络

相似文献

相关主题

期刊订阅