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

Date

2016-04-06

Free to read from

Supervisor/s

Journal Title

Journal ISSN

Volume Title

Publisher

Palgrave MacMillan

Department

Type

Article

ISSN

0160-5682

Format

Citation

S. Afshin Mansouri and Emel Aktas. Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem. Journal of the Operational Research Society, Vol. 67, Issue 11, 2016, pp. 1382-1394

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.

Description

Software Description

Software Language

Github

Keywords

scheduling, production, energy consumption, multi-objective, heuristics, genetic algorithms

DOI

Rights

Attribution-NonCommercial 4.0 International

Relationships

Relationships

Supplements

Funder/s