A hybrid evolutionary approach for lexicographic green flexible jobshop with interval uncertainty

Abstract This article addresses the flexible job shop problem with uncertain processing times modelled by intervals. Due to climate change and the need for energy efficiency, there is an increasing interest in sustainability in addition to traditional production-related objectives such as makespan. In this work, we tackle a lexicographical goal programming scenario minimising makespan firstly and total energy consumption lately. We propose a hybrid evolutionary algorithm based on a genetic algorithm, incorporating heuristic seeding and a post-processing step using constraint programming. The experimental study shows that the proposed approach is able to meet tighter makespan goals than previously published methods, while offering a 32% improvement in energy consumption when goals are met.

Authors

Institutions

Publication Details

Journal
Natural Computing
Published
2025-05-19
DOI
https://doi.org/10.1007/s11047-025-10016-x
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A hybrid evolutionary approach for lexicographic green flexible jobshop with interval uncertainty

Sezin Afşar, Inés González-Rodríguez, Jorge Puente, Camino R. Vela et al.
Natural Computing
Scheduling and Optimization Algorithms
article

A hybrid evolutionary approach for lexicographic green flexible jobshop with interval uncertainty

Sezin Afşar, Inés González-Rodríguez, Jorge Puente, Camino R. Vela, Juan José Palacios
article en

Abstract

Abstract This article addresses the flexible job shop problem with uncertain processing times modelled by intervals. Due to climate change and the need for energy efficiency, there is an increasing interest in sustainability in addition to traditional production-related objectives such as makespan. In this work, we tackle a lexicographical goal programming scenario minimising makespan firstly and total energy consumption lately. We propose a hybrid evolutionary algorithm based on a genetic algorithm, incorporating heuristic seeding and a post-processing step using constraint programming. The experimental study shows that the proposed approach is able to meet tighter makespan goals than previously published methods, while offering a 32% improvement in energy consumption when goals are met.

Natural ComputingVol. 24(3)
Universidad de Cantabria (ES), Universidad de Oviedo (ES)
Universidad de Oviedo, Agencia Estatal de Investigación
Openalex Percentile: Top 85%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.