New Heuristic For Single Machine Semi-online Total Completion Time Minimization

H. Nouinou; T. Arbaoui; A. Yalaoui

首页> 外文期刊>IFAC PapersOnLine >New Heuristic For Single Machine Semi-online Total Completion Time Minimization

【24h】

New Heuristic For Single Machine Semi-online Total Completion Time Minimization

机译：新的启发式单机半球线完成时间最小化

获取原文

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

开具论文收录证明 >>

页面导航

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

摘要

This paper addresses a semi-online setting of the minimization of the total completion time scheduling problem on a single machine, where jobs arrive over-time, i.e., each job has a corresponding release date at which it becomes available for processing. In this study, the case where the release dates of the jobs are known at the beginning of the decision process is considered while processing times remain unknown. A semi-online algorithm that makes use of the available information in order to produce better schedules compared to its online peers is presented. A numerical analysis is established, showing the impact of having this information about release dates.

机译：本文讨论了一台机器上最小化完成时间调度问题的半联机设置，其中作业到达过时，即，每个作业都有一个相应的发布日期，它可以用于处理。在本研究中，在处理时间仍然未知的情况下，考虑在决策过程开始时已知作业的发布日期的情况。呈现了使用可用信息的半球线算法，以便与其在线对等体相比产生更好的时间表。建立了数值分析，显示了在发布日期的这些信息的影响。

著录项

来源
《IFAC PapersOnLine》 |2020年第2期|共6页
作者
H. Nouinou; T. Arbaoui; A. Yalaoui;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种
中图分类
关键词
Total completion timeSemi-online schedulingNumerical analysis;

机译：完整完成时间Imemi-Online Schedulingnumerical分析;

相似文献

外文文献
中文文献
专利

1. Heuristics for Minimizing Total Completion Time and Number of Tardy Jobs Simultaneously on Single Machine with Release Time [J] . E.O. Oyetunji, A.E. Oluleye Research Journal of Applied Sciences: RJAS . 2008,第2期

机译：在具有释放时间的单机上同时最小化总完成时间和延迟作业数量的启发式方法
2. 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期

机译：在线启发式抢占式单机调度问题，可最大程度减少总加权完成时间
3. Heuristics for minimizing total completion time and maximum lateness on identical parallel machines with setup times [J] . M. T. Yazdani Sabouni, F. Jolai, A. Mansouri Journal of Intelligent Manufacturing . 2010,第4期

机译：启发式方法，可在相同的并行计算机上以设置时间最大程度地减少总完成时间和最大延迟
4. Heuristics for Minimizing Total Completion Time on Single Machine with Release Time [C] . E. O. Oyetunji, A. E. Oluleye International Conference on Engineering Research and Development . 2007

机译：最大限度地减少单机的总完成时间，释放时间
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. 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. An Algorithm for Single Machine Sequencing with Release Dates to Minimize Total Weighted Completion Time [R] . Hariri, A. M. A., Potts, C. N. 1981

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

New Heuristic For Single Machine Semi-online Total Completion Time Minimization

摘要

著录项

相似文献

相关主题

期刊订阅