Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem

Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20164108
Volume: 67
Issue: 11
Start Page Number: 1382
End Page Number: 1394
Publication Date: Nov 2016
Journal: J Oper Res Soc
Authors: ,
Keywords: production, energy, scheduling, heuristics, programming: multiple criteria, heuristics: genetic algorithms
Abstract:

Energy consumption has become a key concern for manufacturing sector because of negative environmental impact of operations. We develop constructive heuristics and multi‐objective genetic algorithms (MOGA) for a two‐machine sequence‐dependent permutation flowshop problem to address the trade‐off between energy consumption as a measure of sustainability and makespan as a measure of service level. We leverage the variable speed of operations to develop energy‐efficient schedules that minimize total energy consumption and makespan. As minimization of energy consumption and minimization of makespan are conflicting objectives, the solutions to this problem constitute a Pareto frontier. We compare the performance of constructive heuristics and MOGAs with CPLEX and random search in a wide range of problem instances. The results show that MOGAs hybridized with constructive heuristics outperform regular MOGA and heuristics alone in terms of quality and cardinality of Pareto frontier. We provide production planners with new and scalable solution techniques that will enable them to make informed decisions considering energy consumption together with service objectives in shop floor scheduling.

Reviews

Required fields are marked *. Your email address will not be published.