arrow
返回

Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects

delete2013-08-01
delete47
PRE
AI
A
Alex J. Ruiz‐Torres *
G
Giuseppe Paletta
E
Eduardo Pérez
DOI:10.1016/j.cor.2013.02.018delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
A new unrelated parallel machine scheduling problem with deteriorating effect and the objective of makespan minimization is presented in this paper. The deterioration of each machine (and therefore of the job processing times) is a function of the sequence of jobs that have been processed by the machine and not (as considered in the literature) by the time at which each job is assigned to the machine or by the number of jobs already processed by the machine. It is showed that for a single machine the problem can be solved in polynomial time, whereas the problem is NP-hard when the number of machines is greater or equal than two. For the last case, a set of list scheduling algorithms and simulated annealing meta-heuristics are designed and the effectiveness of these approaches is evaluated by solving a large number of benchmark instances. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Multiprocessor scheduling
Unrelated parallel machines
Machine and job deterioration
Simulated annealing meta-heuristic
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

T
texas state university san marcos
学者数:
2.1K
论文数: 1.8K
被引数: 10
U
university of puerto rico
学者数:
6.3K
论文数: 4.3K
被引数: 17
Texas State University System 封面图
Texas State University System
学者数:
5.5K
论文数: 4.9K
被引数: 13
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
学者 查看更多内容