Minimum-Energy Scheduling of Flexible Job-Shop Through Optimization and Comprehensive Heuristic

This study considers a flexible job-shop scheduling problem where energy cost savings are the primary objective and where the classical objective of the minimization of the make-span is replaced by the satisfaction of due times for each job. An original two-level mixed-integer formulation of this op...

Full description

Saved in:
Bibliographic Details
Main Authors: Oludolapo Akanni Olanrewaju, Fabio Luiz Peres Krykhtine, Felix Mora-Camino
Format: Article
Language:English
Published: MDPI AG 2024-11-01
Series:Algorithms
Subjects:
Online Access:https://www.mdpi.com/1999-4893/17/11/520
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1846154724405936128
author Oludolapo Akanni Olanrewaju
Fabio Luiz Peres Krykhtine
Felix Mora-Camino
author_facet Oludolapo Akanni Olanrewaju
Fabio Luiz Peres Krykhtine
Felix Mora-Camino
author_sort Oludolapo Akanni Olanrewaju
collection DOAJ
description This study considers a flexible job-shop scheduling problem where energy cost savings are the primary objective and where the classical objective of the minimization of the make-span is replaced by the satisfaction of due times for each job. An original two-level mixed-integer formulation of this optimization problem is proposed, where the processed flows of material and their timing are explicitly considered. Its exact solution is discussed, and, considering its computational complexity, a comprehensive heuristic, balancing energy performance and due time constraint satisfaction, is developed to provide acceptable solutions in polynomial time to the minimum-energy flexible job-shop scheduling problem, even when considering its dynamic environment. The proposed approach is illustrated through a small-scale example.
format Article
id doaj-art-d3681995939f4e8c95bc8c1c2c2f0dc1
institution Kabale University
issn 1999-4893
language English
publishDate 2024-11-01
publisher MDPI AG
record_format Article
series Algorithms
spelling doaj-art-d3681995939f4e8c95bc8c1c2c2f0dc12024-11-26T17:45:29ZengMDPI AGAlgorithms1999-48932024-11-01171152010.3390/a17110520Minimum-Energy Scheduling of Flexible Job-Shop Through Optimization and Comprehensive HeuristicOludolapo Akanni Olanrewaju0Fabio Luiz Peres Krykhtine1Felix Mora-Camino2Industrial Engineering Department, Durban University of Technology, Steve Bicko Campus, Durban 4001, South AfricaIndustrial Engineering Department, Escola Politécnica, Universidade Federal do Rio de Janeiro, Rio de Janeiro 21941-853, BrazilIndustrial Engineering Department, Durban University of Technology, Steve Bicko Campus, Durban 4001, South AfricaThis study considers a flexible job-shop scheduling problem where energy cost savings are the primary objective and where the classical objective of the minimization of the make-span is replaced by the satisfaction of due times for each job. An original two-level mixed-integer formulation of this optimization problem is proposed, where the processed flows of material and their timing are explicitly considered. Its exact solution is discussed, and, considering its computational complexity, a comprehensive heuristic, balancing energy performance and due time constraint satisfaction, is developed to provide acceptable solutions in polynomial time to the minimum-energy flexible job-shop scheduling problem, even when considering its dynamic environment. The proposed approach is illustrated through a small-scale example.https://www.mdpi.com/1999-4893/17/11/520flexible job shopschedulingenergy savingsmake-spantwo-level MILPheuristics
spellingShingle Oludolapo Akanni Olanrewaju
Fabio Luiz Peres Krykhtine
Felix Mora-Camino
Minimum-Energy Scheduling of Flexible Job-Shop Through Optimization and Comprehensive Heuristic
Algorithms
flexible job shop
scheduling
energy savings
make-span
two-level MILP
heuristics
title Minimum-Energy Scheduling of Flexible Job-Shop Through Optimization and Comprehensive Heuristic
title_full Minimum-Energy Scheduling of Flexible Job-Shop Through Optimization and Comprehensive Heuristic
title_fullStr Minimum-Energy Scheduling of Flexible Job-Shop Through Optimization and Comprehensive Heuristic
title_full_unstemmed Minimum-Energy Scheduling of Flexible Job-Shop Through Optimization and Comprehensive Heuristic
title_short Minimum-Energy Scheduling of Flexible Job-Shop Through Optimization and Comprehensive Heuristic
title_sort minimum energy scheduling of flexible job shop through optimization and comprehensive heuristic
topic flexible job shop
scheduling
energy savings
make-span
two-level MILP
heuristics
url https://www.mdpi.com/1999-4893/17/11/520
work_keys_str_mv AT oludolapoakanniolanrewaju minimumenergyschedulingofflexiblejobshopthroughoptimizationandcomprehensiveheuristic
AT fabioluizpereskrykhtine minimumenergyschedulingofflexiblejobshopthroughoptimizationandcomprehensiveheuristic
AT felixmoracamino minimumenergyschedulingofflexiblejobshopthroughoptimizationandcomprehensiveheuristic