首页> 外文OA文献 >ACCURACY OF A HEURISTIC FOR TOTAL WEIGHTED COMPLETION TIME MINIMIZATION IN PREEMPTIVE SINGLE MACHINE SCHEDULING PROBLEM BY NO IDLE TIME INTERVALS

【2h】

ACCURACY OF A HEURISTIC FOR TOTAL WEIGHTED COMPLETION TIME MINIMIZATION IN PREEMPTIVE SINGLE MACHINE SCHEDULING PROBLEM BY NO IDLE TIME INTERVALS

机译：在抢占式单机调度问题中，抢占完整时间最小化的启发式的准确性没有空闲时间间隔

代理获取

本网站仅为用户提供外文OA文献查询和代理获取服务，本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文，但由于OA文献来源多样且变更频繁，仍可能出现获取不到、文献不完整或与标题不符等情况，如果获取不到我们将提供退款服务。请知悉。

页面导航

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

著录项

作者
Vadim V. Romanuke;
展开▼
作者单位

展开▼
年度 2019
总页数
原文格式 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. Properties of Optimal Schedules for the Minimization Total Weighted Completion Time in Preemptive Equal-length Job with Release Dates Scheduling Problem on a Single Machine [J] . A. A. Lazarev, A. G. Kvaratskhelia Automation and Remote Control . 2010,第10期

机译：单机上具有发布日期计划问题的抢占式等长作业中使总加权完成时间最小化的最佳计划的属性
3. Single machine scheduling problem with interval processing times to minimize mean weighted completion time [J] . Allahverdi Ali, Aydilek Harun, Aydilek Asiye Computers & operations research . 2014,第nova期

机译：具有间隔处理时间的单机调度问题，以最大程度地减少平均加权完成时间
4. A GA-based heuristic algorithm for non-permutation two-machine robotic flow-shop scheduling problem of minimizing total weighted completion time [C] . The IEEE International Conference on Industrial Engineering and Engineering Management . 2010

机译：基于遗传算法的启发式算法，用于最小化总加权完成时间的非置换两机机器人流水车间调度问题
5. Heuristic algorithms to minimize total weighted tardiness on the single machine and identical parallel machines with sequence dependent setup and future ready time [D] . Xi, Yue 2013

机译：启发式算法，可最大程度地降低单机和相同并行机上的总加权拖尾率，并具有与序列相关的设置和未来准备时间
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. A Heuristic’s Job Order Gain in Pyramidal Preemptive Job Scheduling Problems for Total Weighted Completion Time Minimization [O] . Vadim Romanuke 2019

机译：启发式的作业订单在金字塔抢先型作业调度问题中获得总加权完成时间最小化
8. An Algorithm for Single Machine Sequencing with Release Dates to Minimize Total Weighted Completion Time [R] . Hariri, A. M. A., Potts, C. N. 1981

机译：具有发布日期的单机排序算法最小化总加权完成时间

ACCURACY OF A HEURISTIC FOR TOTAL WEIGHTED COMPLETION TIME MINIMIZATION IN PREEMPTIVE SINGLE MACHINE SCHEDULING PROBLEM BY NO IDLE TIME INTERVALS

著录项

引文网络

相似文献

相关主题

期刊订阅