Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends

MM Yenisey, B Yagmahan - Omega, 2014 - Elsevier
The flow shop scheduling problem is finding a sequence given n jobs with same order at m
machines according to certain performance measure (s). The job can be processed on at …

Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey

M Gen, L Lin - Journal of Intelligent Manufacturing, 2014 - Springer
Scheduling is an important tool for a manufacturing system, where it can have a major
impact on the productivity of a production process. In order to find an optimal solution to …

A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling

S Schulz, JS Neufeld, U Buscher - Journal of cleaner production, 2019 - Elsevier
Growing environmental awareness and the relevance of energy costs in many industries
has led to the need of improving energy efficiency in operations management; hence …

A review and classification of computer-based manufacturing scheduling tools

M Dios, JM Framinan - Computers & Industrial Engineering, 2016 - Elsevier
Computer-based manufacturing scheduling tools can play a key role in the management of
industrial operations, as obtaining economic and reliable schedules is at the core of …

An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem

LP Cota, FG Guimarães, RG Ribeiro… - Swarm and Evolutionary …, 2019 - Elsevier
Green machine scheduling consists in the allocation of jobs in order to maximize production,
in view of the sustainable use of energy. This work addresses the unrelated parallel …

Improving pareto local search using cooperative parallelism strategies for multiobjective combinatorial optimization

J Shi, J Sun, Q Zhang, H Zhang… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Pareto local search (PLS) is a natural extension of local search for multiobjective
combinatorial optimization problems (MCOPs). In our previous work, we improved the …

Anytime Pareto local search

J Dubois-Lacoste, M López-Ibáñez, T Stützle - European journal of …, 2015 - Elsevier
Abstract Pareto Local Search (PLS) is a simple and effective local search method for tackling
multi-objective combinatorial optimization problems. It is also a crucial component of many …

PPLS/D: Parallel Pareto local search based on decomposition

J Shi, Q Zhang, J Sun - IEEE transactions on cybernetics, 2018 - ieeexplore.ieee.org
Pareto local search (PLS) is a basic building block in many metaheuristics for a
multiobjective combinatorial optimization problem. In this paper, an enhanced PLS variant …

An improved Pareto local search for solving bi-objective scheduling problems in hot rolling mills

SL Jiang, W Li, X Zhang, C Xu - Computers & Industrial Engineering, 2022 - Elsevier
Hot rolling scheduling is a complex decision-making optimization problem in the production
management of the iron and steel industry. Comprehensively considering temporal and …

Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment

A Hassanzadeh, M Rasti-Barzoki, H Khosroshahi - Applied soft computing, 2016 - Elsevier
In this study, an integrated multi-objective production-distribution flow-shop scheduling
problem will be taken into consideration with respect to two objective functions. The first …