用户名: 密码: 验证码:
Scheduling identical parallel machines with tooling constraints
详细信息    查看全文
文摘
class="listitem" id="list_celist0001">
class="label">•

We consider a job sequencing problem with tool requirements.

class="label">•

We solve the problem using adaptive large neighborhood search.

class="label">•

The algorithm is tested on instances with 200 jobs, 10 machines and 40 tools.

class="label">•

Computational results demonstrate the efficiency of the algorithm.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700