Multicriteria hybrid flow shop scheduling problem: literature review, analysis, and future research

This research focuses on the Hybrid Flow Shop production scheduling problem, which is one of the most difficult problems to solve. The literature points to several studies that focus the Hybrid Flow Shop scheduling problem with monocriteria functions. Despite of the fact that, many real world problems involve several objective functions, they can often compete and conflict, leading researchers to concentrate direct their efforts on the development of methods that take consider this variant into consideration. The goal of the study is to review and analyze the methods in order to solve the Hybrid Flow Shop production scheduling problem with multicriteria functions in the literature. The analyses were performed using several papers that have been published over the years, also the parallel machines types, the approach used to develop solution methods, the type of method develop, the objective function, the performance criterion adopted, and the additional constraints considered. The results of the reviewing and analysis of 46 papers showed opportunities for future researchon this topic, including the following: (i) use uniform and dedicated parallel machines, (ii) use exact and metaheuristics approaches, (iv) develop lower and uppers bounds, relations of dominance and different search strategiesto improve the computational time of the exact methods,  (v) develop  other types of metaheuristic, (vi) work with anticipatory setups, and (vii) add constraints faced by the production systems itself

A Keyword, Taxonomy and Cartographic Research Review of Sustainability Concepts for Production Scheduling in Manufacturing Systems

The concept of sustainability is defined as composed of three pillars: social, environmental, and economic. Social sustainability implies a commitment to equity in terms of several “interrelated and mutually supportive” principles of a “sustainable society”; this concept includes attitude change, the Earth’s vitality and diversity conservation, and a global alliance to achieve sustainability. The social and environmental aspects of sustainability are related in the way sustainability indicators are related to “quality of life” and “ecological sustainability”. The increasing interest in green and sustainable products and production has influenced research interests regarding sustainable scheduling problems in manufacturing systems. This study is aimed both at reducing pollutant emissions and increasing production efficiency: this topic is known as Green Scheduling. Existing literature research reviews on Green Scheduling Problems have pointed out both theoretical and practical aspects of this topic. The proposed work is a critical review of the scientific literature with a three-pronged approach based on keywords, taxonomy analysis, and research mapping. Specific research questions have been proposed to highlight the benefits and related objectives of this review: to discover the most widely used methodologies for solving SPGs in manufacturing and identify interesting development models, as well as the least studied domains and algorithms. The literature was analysed in order to define a map of the main research fields on SPG, highlight mainstream SPG research, propose an efficient view of emerging research areas, propose a taxonomy of SPG by collecting multiple keywords into semantic clusters, and analyse the literature according to a semantic knowledge approach. At the same time, GSP researchers are provided with an efficient view of emerging research areas, allowing them to avoid missing key research areas and focus on emerging ones

Advances in Condition Monitoring, Optimization and Control for Complex Industrial Processes

The book documents 25 papers collected from the Special Issue “Advances in Condition Monitoring, Optimization and Control for Complex Industrial Processes”, highlighting recent research trends in complex industrial processes. The book aims to stimulate the research field and be of benefit to readers from both academic institutes and industrial sectors

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

A research survey: review of flexible job shop scheduling techniques

In the last 25 years, extensive research has been carried out addressing the flexible job shop scheduling (JSS) problem. A variety of techniques ranging from exact methods to hybrid techniques have been used in this research. The paper aims at presenting the development of flexible JSS and a consolidated survey of various techniques that have been employed since 1990 for problem resolution. The paper comprises evaluation of publications and research methods used in various research papers. Finally, conclusions are drawn based on performed survey results. A total of 404 distinct publications were found addressing the FJSSP. Some of the research papers presented more than one technique/algorithm to solve the problem that is categorized into 410 different applications. Selected time period of these research papers is between 1990 and February 2014. Articles were searched mainly on major databases such as SpringerLink, Science Direct, IEEE Xplore, Scopus, EBSCO, etc. and other web sources. All databases were searched for “flexible job shop” and “scheduling” in the title an

A Hybrid Estimation of Distribution Algorithm for Simulation-Based Scheduling in a Stochastic Permutation Flowshop

The permutation flowshop scheduling problem (PFSP) is NP-complete and tends to be more complicated when considering stochastic uncertainties in the real-world manufacturing environments. In this paper, a two-stage simulation-based hybrid estimation of distribution algorithm (TSSB-HEDA) is presented to schedule the permutation flowshop under stochastic processing times. To deal with processing time uncertainty, TSSB-HEDA evaluates candidate solutions using a novel two-stage simulation model (TSSM). This model first adopts the regression-based meta-modelling technique to determine a number of promising candidate solutions with less computation cost, and then uses a more accurate but time-consuming simulator to evaluate the performance of these selected ones. In addition, to avoid getting trapped into premature convergence, TSSB-HEDA employs both the probabilistic model of EDA and genetic operators of genetic algorithm (GA) to generate the offspring individuals. Enlightened by the weight training process of neural networks, a self-adaptive learning mechanism (SALM) is employed to dynamically adjust the ratio of offspring individuals generated by the probabilistic model. Computational experiments on Taillard’s benchmarks show that TSSB-HEDA is competitive in terms of both solution quality and computational performance

Genetic Algorithm for Solving the Integrated Production-Distribution-Direct Transportation Planning

This paper proposes a model of integrated production, distribution and transportation planning for 4-echelon supply chain system that consists of a manufacturer using a continuous production process, a distribution center, distributors and retailers. By means of time-dependent demand at all retailers and direct transportation from one echelon to its successive echelons, the purpose of this paper is to determine production/replenishment and transportation policies at manufacturer, distribution center, distributors and retailers in order to minimize annually total system cost. Due to the proposed model is classified as a mixed integer non-linear programming so it is almost impossible to solve the model using the exact optimization methods and a lot of time is needed when the enumeration methods is applied to solve only a small scale problem. In this paper, we apply the genetic algorithm for solving the model. Using integer encoding for constructing the chromosome, the best solution is going to be searched. Compared with enumeration method, the difference of the result is only 0.0594% with the consumption time is only 0.5609% time that enumeration methods need

Energy-Aware Multi-Objective Job Shop Scheduling Optimization with Metaheuristics in Manufacturing Industries: A Critical Survey, Results, and Perspectives

In recent years, the application of artificial intelligence has been revolutionizing the manufacturing industry, becoming one of the key pillars of what has been called Industry 4.0. In this context, we focus on the job shop scheduling problem (JSP), which aims at productions orders to be carried out, but considering the reduction of energy consumption as a key objective to fulfill. Finding the best combination of machines and jobs to be performed is not a trivial problem and becomes even more involved when several objectives are taken into account. Among them, the improvement of energy savings may conflict with other objectives, such as the minimization of the makespan. In this paper, we provide an in-depth review of the existing literature on multi-objective job shop scheduling optimization with metaheuristics, in which one of the objectives is the minimization of energy consumption. We systematically reviewed and critically analyzed the most relevant features of both problem formulations and algorithms to solve them effectively. The manuscript also informs with empirical results the main findings of our bibliographic critique with a performance comparison among representative multi-objective evolutionary solvers applied to a diversity of synthetic test instances. The ultimate goal of this article is to carry out a critical analysis, finding good practices and opportunities for further improvement that stem from current knowledge in this vibrant research area.Javier Del Ser acknowledges funding support from the Basque Government (consolidated research group MATHMODE, Ref. IT1294-19). Antonio J. Nebro is supported by the Spanish Ministry of Science and Innovation via Grant PID2020-112540RB-C41 (AEI/FEDER, UE) and the Andalusian PAIDI program with Grant P18-RT-2799

Research in Supply Chain Management: Issue and Area Development

Today the study of supply chain management (SCM) is growing rapidly and provides a great opportunity to do research both empirical and theoretical development. Research opportunities in SCM has been reviewed by many researchers and grouped into many categories. This paper contains a review of research SCM and classify into 7 categories, namely (1) SCM Operational Management & Strategy, (2) knowledge management, (3) Relationship Management, (4) Information Technology in SCM, (5) Supply Chain Design, Logistics & Infrastructure, (6) Global Issues, (7) Environment, Legal & Regulations. The issue in each category and research opportunities will be discussed in this paper. Keywords: Supply Chain Management, Research Opportunities in SCM, Issue in SC