Scheduling identical parallel machines with tooling constraints
详细信息 查看全文
- 作者：Andreza Cristina Beezã ; o ; a ; andreza.beezao@gmail.com" class="auth_mail" title="E-mail the corresponding author ; andreza@icmc.usp.br" class="auth_mail" title="E-mail the corresponding author ; Jean-Franç ; ois Cordeaub ; jean-francois.cordeau@hec.ca" class="auth_mail" title="E-mail the corresponding author ; Gilbert Laportec ; gilbert.laporte@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author ; Horacio Hideki Yanassed ; horacio.yanasse@unifesp.br" class="auth_mail" title="E-mail the corresponding author
- 关键词：Flexible manufacturing systems ; Parallel machines ; Sequence-dependent setup times ; Tooling constraints ; Adaptive large neighborhood search
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：16 March 2017
- 年：2017
- 卷：257
- 期：3
- 页码：834-844
- 全文大小：1039 K
文摘
- •
We consider a job sequencing problem with tool requirements.
- •
We solve the problem using adaptive large neighborhood search.
- •
The algorithm is tested on instances with 200 jobs, 10 machines and 40 tools.
- •
Computational results demonstrate the efficiency of the algorithm.