.png){kind=icon}
返回
Mixed graph colouring for unit-time scheduling
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2016.1224950.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the job shop scheduling problem with unit-time operations and the makespan criterion. This problem is reduced to finding an optimal colouring of a special class of mixed graph, where its partial graph without edges represents the union of maximal directed paths and its partial graph without arcs represents the union of maximal cliques. As the problem is known to be NP-hard, both exact and heuristic methods are proposed to solve it. This study is carried out in three steps. First, a new lower and upper bounds for the mixed chromatic number are proposed. Afterwards, a colour-indexed mathematical model using the proposed bounds is developed. Then, a tabu search using a dynamic neighbourhood structure is adapted for solving large instances. Computational experiments conducted on several modified benchmarks show the efficiency and effectiveness of the proposed resolution methods.
Keyword:
mixed graph colouring
job shop scheduling
lower and upper bounds
mixed integer linear programming
tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Variable neighborhood tabu search and its application to the median cycle problem变邻域禁忌搜索及其在中环问题中的应用
PREAI
分享收藏Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏分享收藏分享收藏Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems用于考试时间表和图形着色问题的混合启发式的自适应自动构造
OAAI
OAAI分享收藏
查看更多内容