Traditional job shop scheduling is concentrated on centralized scheduling or semi-distributed scheduling. Under the Industry 4.0, the scheduling should deal with a smart and distributed manufacturing system supported by novel and emerging manufacturing technologies such as mass customization, Cyber-Physics Systems, Digital Twin, and SMAC (Social, Mobile, Analytics, Cloud). The scheduling research needs to shift its focus to smart distributed scheduling modeling and optimization. In order to transferring traditional scheduling into smart distributed scheduling (SDS), we aim to answer two questions: (1) what traditional scheduling methods and techniques can be combined and reused in SDS and (2) what are new methods and techniques required for SDS. In this paper, we first review existing researches from over 120 papers and answer the first question and then we explore a future research direction in SDS and discuss the new techniques for developing future new JSP scheduling models and constructing a framework on solving the JSP problem under Industry 4.0.

/pdf/review-of-job-shop-scheduling-research-and-its-new-2zwek53yez.pdf

Review of job shop scheduling research and its new perspectives under Industry 4.0

Flexible job-shop scheduling problem (FJSP) is very important in many research fields such as production management and combinatorial optimization. The FJSP problems cover two difficulties namely machine assignment problem and operation sequencing problem. In this paper, we apply particle swarm optimization (PSO) algorithm to solve this FJSP problem aiming to minimize the maximum completion time criterion. Various benchmark data taken from literature, varying from Partial FJSP and Total FJSP, are tested. Experimental results proved that the developed PSO is enough effective and efficient to solve the FJSP. Our other objective in this paper, is to study the distribution of the PSO-solving method for future implementation on embedded systems that can make decisions in real time according to the state of resources and any unplanned or unforeseen events. For this aim, two multi-agent based approaches are proposed and compared using different benchmark instances.

An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem

Centralized charging of electric vehicles (EVs) based on battery swapping is a promising strategy for their large-scale utilization in power systems. The most outstanding feature of this strategy is that EV batteries can be replaced within a short time and can be charged during off-peak periods or on low electric price and scheduled in any battery swap station. This paper proposes a novel centralized charging strategy of EVs under the battery swapping scenario by considering optimal charging priority and charging location (station or bus node in a power system) based on spot electric price. In this strategy, a population-based heuristic approach is designed to minimize total charging cost, as well as to reduce power loss and voltage deviation of power networks. We introduce a dynamic crossover and adaptive mutation strategy into a hybrid algorithm of particle swarm optimization and genetic algorithm. The resulting algorithm and several others are executed on an IEEE 30-bus test system, and the results suggest that the proposed one is effective and promising for optimal EV centralized charging.

Centralized Charging Strategy and Scheduling Algorithm for Electric Vehicles Under a Battery Swapping Scenario

Flexible job shop scheduling problems &#x0028 FJSP &#x0029 have received much attention from academia and industry for many years. Due to their exponential complexity, swarm intelligence &#x0028 SI &#x0029 and evolutionary algorithms &#x0028 EA &#x0029 are developed, employed and improved for solving them. More than 60&#x0025 of the publications are related to SI and EA. This paper intents to give a comprehensive literature review of SI and EA for solving FJSP. First, the mathematical model of FJSP is presented and the constraints in applications are summarized. Then, the encoding and decoding strategies for connecting the problem and algorithms are reviewed. The strategies for initializing algorithms? population and local search operators for improving convergence performance are summarized. Next, one classical hybrid genetic algorithm &#x0028 GA &#x0029 and one newest imperialist competitive algorithm &#x0028 ICA &#x0029 with variables neighborhood search &#x0028 VNS &#x0029 for solving FJSP are presented. Finally, we summarize, discus and analyze the status of SI and EA for solving FJSP and give insight into future research directions.

A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems

Over the ages, nature has constantly been a rich source of inspiration for science, with much still to discover about and learn from. Swarm Intelligence (SI), a major branch of artificial intelligence, was rendered to model the collective behavior of social swarms in nature. Ultimately, Particle Swarm Optimization algorithm (PSO) is arguably one of the most popular SI paradigms. Over the past two decades, PSO has been applied successfully, with good return as well, in a wide variety of fields of science and technology with a wider range of complex optimization problems, thereby occupying a prominent position in the optimization field. However, through in-depth studies, a number of problems with the algorithm have been detected and identified; e.g., issues regarding convergence, diversity, and stability. Consequently, since its birth in the mid-1990s, PSO has witnessed a myriad of enhancements, extensions, and variants in various aspects of the algorithm, specifically after the twentieth century, and the related research has therefore now reached an impressive state. In this paper, a rigorous yet systematic review is presented to organize and summarize the information on the PSO algorithm and the developments and trends of its most basic as well as of some of the very notable implementations that have been introduced recently, bearing in mind the coverage of paradigm, theory, hybridization, parallelization, complex optimization, and the diverse applications of the algorithm, making it more accessible. Ease for researchers to determine which PSO variant is currently best suited or to be invented for a given optimization problem or application. This up-to-date review also highlights the current pressing issues and intriguing open challenges haunting PSO, prompting scholars and researchers to conduct further research both on the theory and application of the algorithm in the forthcoming years.

Major Advances in Particle Swarm Optimization: Theory, Analysis, and Application

Flexible job-shop scheduling problem (FJSP) is very important in many research fields such as production management and combinatorial optimization. The FJSP problems cover two difficulties namely machine assignment problem and operation sequencing problem. In this paper, we apply particle swarm optimization (PSO) algorithm to solve this FJSP problem aiming to minimize the maximum completion time criterion. Various benchmark data taken from literature, varying from Partiel FJSP and Total FJSP, are tested. Computational results proved that the PSO developed is enough effective and efficient to solve flexible job-shop scheduling problem.

http://ieeexplore.ieee.org/iel7/6745854/6761346/06761365.pdf

An effective particle swarm optimization algorithm for flexible job-shop scheduling problem

https://ieeexplore.ieee.org/iel7/6745854/6761346/06761365.pdf

Abderezak Jemai

Papers

An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem

An effective particle swarm optimization algorithm for flexible job-shop scheduling problem

An effective particle swarm optimization algorithm for flexible job-shop scheduling problem