Lagrangian approach to minimize makespan of non-identical parallel batch processing machines

详细信息    查看全文

• 作者：Nurul Suhaimi ^{nmsuhaimi@gmail.com} ; Christine Nguyen ; ^{cnguyen@niu.edu} ; Purushothaman Damodaran ^{pdamodaran@niu.edu}
• 关键词：Scheduling ; Batch processing machines ; Makespan ; Lagrangian Relaxation approach
• 刊名：Computers & Industrial Engineering
• 出版年：2016
• 出版时间：November 2016
• 年：2016
• 卷：101
• 期：Complete
• 页码：295-302
• 全文大小：452 K
• 卷排序：101

文摘

Proposes a Lagrangian Relaxation of the non-identical parallel batch processing machine problem. Compares to Particle Swarm Optimization (PSO), Random Keys Genetic Algorithm (RKGA), and CPLEX. Conducts experiments for two and four machine problems of various number of jobs. Shows Lagrangian Relaxation identifies new, improved solutions for several benchmark instances.