期刊
OR SPECTRUM
卷 41, 期 1, 页码 179-217出版社
SPRINGER
DOI: 10.1007/s00291-018-0537-z
关键词
Scheduling; Flexible job shop; Decomposition; Logic inequalities; Vehicle routing
资金
- European Union [EFRE-0800463]
- state North Rhine-Westphalia through the European Fund for Regional Development (EFRD) [EFRE-0800463]
We consider a flexible job shop scheduling problem with sequence-dependent setup times that incorporates heterogeneous machine operator qualifications by taking account of machine- and operator-dependent processing times. We analyze two objective functions, minimizing the makespan and minimizing the total tardiness, and present exact and heuristic decomposition-based solution approaches. These approaches divide the scheduling problem into a vehicle routing problem with precedence constraints and an operator assignment problem, and connect these problems via logic inequalities. We assess the quality of our solution methods in an extensive computational study that is based on randomly generated as well as real-world problem instances.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据