返回
A matheuristic for parallel machine scheduling with tool replacements
DOI:10.1016/j.ejor.2020.09.050.png)
摘要
En 中文
This paper addresses the problem of scheduling a set of jobs with tool requirements on identical parallel machines in a work center. This problem considers the following characteristics. First, each job may consist of an ordered set of operations due to reentrance to the work center. Moreover, operations have release times and due dates, and the processing of operations requires different tool sets of different sizes. Last, the objective is to minimize both tardiness of operations and tool setup times. Decisions concern the assignment of operations to machines, sequencing of operations, and replacement of tool sets on machines. We propose a mathematical model for the problem and a new matheuristic that combines a genetic algorithm and an integer linear programming formulation to solve industry-size instances. In the matheuristic, we propose two crossover operators which exploit the structure of the problem. We illustrate this approach through real-world case studies. Computational experiments show that our matheuristic outperforms the mathematical model and a practitioner heuristic. We also generate managerial insights by quantifying the potential room for improvement in current practice. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Flexible manufacturing systems
Scheduling
Tool switching
Genetic algorithm
Integer linear programming
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
EERZ (Effective Equilibrium Reaction Zone) Model of Gas-Slag-Metal Reactions in the Application of Unconstrained Al-Ni-Cr-Co-Cu Metal Powders in Submerged Arc Welding: Model and 3D Slag SEM Evidence
Processes
IF0

