.png){kind=icon}
返回
Mathematical formulations for the parallel machine scheduling problem with a single server
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2020.1807637.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the problem of scheduling independent jobs on identical parallel machines with a single server to minimise the makespan. We propose mixed integer programming (MIP) formulations to solve this problem. Each formulation reflects a specific concept on how the decision variables are defined. Moreover, we present inequalities that can be used to improve those formulations. A computational study is performed on benchmark instances from the literature to compare the proposed MIP formulations with other known formulations from the literature. It turns out that our proposed time-indexed variables formulation outperforms by far the other formulations. In addition, we propose a very efficient MIP formulation to solve a particular case of the problem with a regular job set. This formulation is able to solve all regular instances for the case of 500 jobs and 5 machines in less than 5.27 min, where all other formulations are not able to produce a feasible solution within 1 h.
Keyword:
Identical parallel machine scheduling
scheduling with a single server
mixed integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Equal processing and equal setup time cases of scheduling parallel machines with a single server
PREAI
分享收藏Effects of Salinity on the Growth, Physiological Characteristics, and Intestinal Microbiota of the Echiura Worm (Urechis unicinctus)盐度对Echiura蠕虫 (Urechis unicintus) 的生长，生理特性和肠道微生物群的影响
OAAI
OAAI分享收藏
查看更多内容