.png){kind=icon}
返回
An exact framework for the discrete parallel machine scheduling location problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105318.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The discrete parallel machine makespan scheduling location (ScheLoc) problem is an integrated combinatorial optimization problem that combines facility location and job scheduling. The problem consists in choosing the locations of multiple machines among a finite set of candidates and scheduling a set of jobs on these machines, aiming to minimize the makespan. Depending on the machine location, the jobs may have different release dates, and thus the location decisions have a direct impact on the scheduling decisions. To solve the problem, it is proposed a new arc-flow formulation, a column generation and three heuristic procedures that are evaluated through extensive computational experiments. By embedding the proposed procedures into a framework algorithm, we are able to find proven optimal solutions for all benchmark instances from the related literature and to obtain small percentage gaps for a new set of challenging instances.
Keyword:
Scheduling
Facility location
Makespan
Heuristics
Exact framework
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
OAAI
.png){kind=icon}
OAAI分享收藏Bin packing and cutting stock problems: Mathematical models and exact algorithms装箱和切割库存问题: 数学模型和精确算法
PREAI
分享收藏Scenario-based heuristic to two-stage stochastic program for the parallel machine ScheLoc problem并行机ScheLoc问题的基于场景的启发式两阶段随机程序
PREAI
分享收藏分享收藏
分享收藏
查看更多内容