Minimizing makespans for unrelated parallel machine scheduling problems

机译：最小化MakEspans对不相关的并行机器调度问题

获取原文

页面导航

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

摘要

This research proposes a two-phase heuristic and an improvement procedure for scheduling unrelated parallel machines problems to minimize makespan.

机译：本研究提出了一种两相启发式和改进程序，用于调度无关的并行机器问题以最大限度地减少MEPESPAN。

著录项

来源
《IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics》|2009年||共4页
会议地点
作者

展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类 TP3-53;
关键词
parallel machines; scheduling; makespans minimization; two-phase heuristic procedure; unrelated parallel machine scheduling problems;

机译：平行机;调度;MEPESPANS最小化;两相启发式程序;不相关的并行机器调度问题;

相似文献

外文文献
中文文献
专利

1. 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最小化设计的比较
2. Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines [J] . P. Sivasankaran, T. Sornakumar, R. Panneerselvam Intelligent Information Management . 2010,第3期

机译：无关并行机的单机调度问题中的有效启发式算法，以最小化制造周期
3. 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与不等作业准备好时期
4. A Mixed Integer Programming Model for Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time to Minimize Makespan and Total Tardiness [C] . Papimol Kongsri, Jirachai Buddhakulsomsiri IEEE International Conference on Industrial Engineering and Applications . 2020

机译：序列依赖的建立时间最小化制造时间和总拖延的无关并行机器调度问题的混合整数规划模型
5. Unrelated parallel machine scheduling with sequence-dependent setup times and machine eligibility restrictions for minimizing the makespan. [D] . Salem, Ameer Hassan. 1999

机译：无关的并行机器调度，具有与序列有关的设置时间和机器合格限制，可最大程度地缩短制造周期。
6. Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times [O] . Absalom E. Ezugwu, Olawale J. Adeleke, Serestina Viriri -1

机译：共生生物搜索算法用于与序列相关的设置时间的无关并行机器调度
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最小化设计跨度的设计与比较

Minimizing makespans for unrelated parallel machine scheduling problems

摘要

著录项

相似文献

相关主题

期刊订阅