scholarly journals A Review of Prediction and Optimization for Sequence-Driven Scheduling in Job Shop Flexible Manufacturing Systems

Processes ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 1391
Author(s):  
Prita Meilanitasari ◽  
Seung-Jun Shin

This article reviews the state of the art of prediction and optimization for sequence-driven scheduling in job shop flexible manufacturing systems (JS-FMSs). The objectives of the article are to (1) analyze the literature related to algorithms for sequencing and scheduling, considering domain, method, objective, sequence type, and uncertainty; and to (2) examine current challenges and future directions to promote the feasibility and usability of the relevant research. Current challenges are summarized as follows: less consideration of uncertainty factors causes a gap between the reality and the derived schedules; the use of stationary dispatching rules is limited to reflect the dynamics and flexibility; production-level scheduling is restricted to increase responsiveness owing to product-level uncertainty; and optimization is more focused, while prediction is used mostly for verification and validation, although prediction-then-optimization is the standard stream in data analytics. In future research, the degree of uncertainty should be quantified and modeled explicitly; both holistic and granular algorithms should be considered; product sequences should be incorporated; and sequence learning should be applied to implement the prediction-then-optimization stream. This would enable us to derive data-learned prediction and optimization models that output accurate and precise schedules; foresee individual product locations; and respond rapidly to dynamic and frequent changes in JS-FMSs.

1991 ◽  
Vol 29 (5) ◽  
pp. 1053-1067 ◽  
Author(s):  
JIM HUTCHISON ◽  
KEONG LEONG ◽  
DAVID SNYDER ◽  
PETER WARD

2021 ◽  
Vol 11 (17) ◽  
pp. 8145
Author(s):  
Philipp Wenzelburger ◽  
Frank Allgöwer

In the context of Industry 4.0, flexible manufacturing systems play an important role. They are designed to provide the possibility to adapt the production process by reacting to changes and enabling customer specific products. The versatility of such manufacturing systems, however, also needs to be exploited by advanced control strategies. To this end, we present a novel scheduling scheme that is able to flexibly react to changes in the manufacturing system by means of Model Predictive Control (MPC). To introduce flexibility from the start, the initial scheduling problem, which is very general and covers a variety of special cases, is formulated in a modular way. This modularity is then preserved during an automatic transformation into a Petri Net formulation, which constitutes the basis for the two presented MPC schemes. We prove that both schemes are guaranteed to complete the production problem in closed loop when reasonable assumptions are fulfilled. The advantages of the presented control framework for flexible manufacturing systems are that it covers a wide variety of scheduling problems, that it is able to exploit the available flexibility of the manufacturing system, and that it allows to prove the completion of the production problem.


Author(s):  
Fraj Naifar ◽  
Mariem Gzara ◽  
Taicir Loukil Moalla

Flexible manufacturing systems have many advantages like adaptation to changes and reduction of lateness. But flexible machines are expensive. The scheduling is a central functionality in manufacturing systems. Optimizing the job routing through the system, while taking advantage from the flexibility of the machines, aims at improving the system's profitability. The introduction of the flexibility defines a variant of the scheduling problems known as flexible job shop scheduling. This variant is more difficult than the classical job shop since two sub-problems are to be solved the assignment and the routing. To guarantee the generation of efficient schedules in reasonable computation time, the metaheuristic approach is largely explored. Particularly, much research has addressed the resolution of the flexible job shop problem by genetic algorithms. This chapter presents the different adaptations of the genetic scheme to the flexible job shop problem. The solution encodings and the genetic operators are presented and illustrated by examples.


Sign in / Sign up

Export Citation Format

Share Document