首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach
Authors:Vinícius Amaral Armentano  Moacir Felizardo de França Filho
Institution:1. Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, Av. Albert Einstein 400, CEP 13083-852, Campinas, SP, Brazil;2. Departamento Acadêmico de Engenharia Mecânica, Centro Federal de Educação Tecnológica de Minas Gerais, Av. Amazonas 7675, CEP 30510-000, Belo Horizonte, MG, Brazil
Abstract:This paper deals with the problem of scheduling jobs in uniform parallel machines with sequence-dependent setup times in order to minimize the total tardiness relative to job due dates. We propose GRASP versions that incorporate adaptive memory principles for solving this problem. Long-term memory is used in the construction of an initial solution and in a post-optimization procedure which connects high quality local optima by means of path relinking. Computational tests are carried out on a set of benchmark instances and the proposed GRASP versions are compared with heuristic methods from the literature.
Keywords:Scheduling  Parallel machines  Setup times  Adaptive memory  Greedy randomized adaptive search procedures
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号