Algorithms for Task Scheduling with Priority in Minimizing Makespan for Unrelated Parallel Processors

机译：不相关并行处理器的最小化制造时间中的优先级任务调度算法

获取原文

获取原文并翻译 | 示例

页面导航

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

摘要

In this paper, we consider a non-preemtive task scheduling problem on unrelated parallel processor with priority consideration. The tasks have to fulfill a priority order before get assigned to any processors on specific rule. The objective of the scheduling is minimizing the maximum of the total completion time among the processors (i.e makespan). We presented MILP models and developed three heuristics to solve the problem [1]. In this paper, we implement and carry out a comprehensive analysis to evaluate the performance and the efficiency of these algorithms.

机译：在本文中，我们考虑具有优先级的无关并行处理器上的非抢占式任务调度问题。在根据特定规则分配给任何处理器之前，这些任务必须满足优先级顺序。调度的目的是最大程度地减少处理器之间的总完成时间（即制造期）。我们提出了MILP模型并开发了三种启发式方法来解决该问题[1]。在本文中，我们实施并进行了全面的分析，以评估这些算法的性能和效率。

著录项

来源
《The 8th international conference on optimization: Techniques and Applications》|2010年|30-31|共2页
会议地点 Shanghai(CN)
作者
Louis Caccetta; Syarifah Zyurina Nordin;
展开▼
作者单位

Western Australian Centre of Excellence in Industrial Optimization (WACEIO),Department of Mathematics and Statistic, Curtin University of Technology,GPO Box U1987, Perth, Western Australia 6845, Australia;

Department of Mathematics and Statistic, Curtin University of Technology,GPO Box U1987, Perth, Western Australia 6845, Australia;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类系统优化;
关键词
Task scheduling; Unrelated parallel processor; Makespan; Priority;

机译：任务调度;无关的并行处理器; Makespan;优先级;

相似文献

外文文献
中文文献
专利

1. EFFICIENT ALGORITHMS TO MINIMIZE MAKESPAN OF THE UNRELATED PARALLEL BATCH-PROCESSING MACHINES SCHEDULING PROBLEM WITH UNEQUAL JOB READY TIMES [J] . Yaser Zarook, Javad Rezaeian, Iraj Mahdavi, RAIRO operations research . 2021,第3期

机译：高效的算法，以最小化不平等的并行批处理机调度问题的Mapspan与不等作业准备好时期
2. Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines [J] . Panneerselvam Sivasankaran, Thambu Sornakumar, Ramasamy Panneerselvam Intelligent Information Management . 2010,第7期

机译：无关联并行机单机调度中模拟退火算法与GRASP最小化设计的比较
3. Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan [J] . JACEK BLAZEWICZ, MACIEJ MACHOWIAK, JAN WEGLARZ, Annals of Operations Research . 2004,第期

机译：在并行处理器上安排可延展的任务，以最大程度地缩短制造时间
4. Algorithms for Task Scheduling with Priority in Minimizing Makespan for Unrelated Parallel Processors [C] . Louis Caccetta, Syarifah Zyurina Nordin International conference on optimization: Techniques and Applications . 2010

机译：优先级的任务调度算法最小化不相关的并行处理器的MakEspan
5. Scheduling parallel batch processing machines to minimize makespan using genetic algorithms. [D] . Hirani, Neal S. 2006

机译：使用遗传算法调度并行批处理机器以最小化制造时间。
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. Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines [O] . Panneerselvam Sivasankaran, Thambu Sornakumar, Ramasamy Panneerselvam 2010

机译：无关联并行机单机调度中模拟退火算法和GRASP最小化设计跨度的设计与比较

Algorithms for Task Scheduling with Priority in Minimizing Makespan for Unrelated Parallel Processors

摘要

著录项

相似文献

相关主题

期刊订阅