Minimizing Makespan And Minimizing Total Energy Cost On Unrelated Parallel Batch Machine With Incompatible Family And Non-Identical Job Sizes

Abstract

In the past few years, the topic of unrelated parallel batch processing machine scheduling has gained significant attention from many industries. Industries are looking for a way to both increase the benefits, production effectiveness and reducing the production cost. This study’s goal is to minimize the makespan and minimize the total electricity cost by proposing a Mixed-integer Linear Programing (MILP) model . Given the complexity of a bi-objective scheduling problem, a meta-heuristic named Pareto based Ant Colony Optimization (PACO) is proposed to solve the problem. The result of this study shows that the proposed algorithm is suitable and effective ly solve the current problem.