Dynamic scheduling in a multi-product manufacturing system

To remain competitive in global marketplace, manufacturing companies need to improve their operational practices. One of the methods to increase competitiveness in manufacturing is by implementing proper scheduling system. This is important to enable job orders to be completed on time, minimize waiting time and maximize utilization of equipment and machineries. The dynamics of real manufacturing system are very complex in nature. Schedules developed based on deterministic algorithms are unable to effectively deal with uncertainties in demand and capacity. Significant differences can be found between planned schedules and actual schedule implementation. This study attempted to develop a scheduling system that is able to react quickly and reliably for accommodating changes in product demand and manufacturing capacity. A case study, 6 by 6 job shop scheduling problem was adapted with uncertainty elements added to the data sets. A simulation model was designed and implemented using ARENA simulation package to generate various job shop scheduling scenarios. Their performances were evaluated using scheduling rules, namely, first-in-first-out (FIFO), earliest due date (EDD), and shortest processing time (SPT). An artificial neural network (ANN) model was developed and trained using various scheduling scenarios generated by ARENA simulation. The experimental results suggest that the ANN scheduling model can provided moderately reliable prediction results for limited scenarios when predicting the number completed jobs, maximum flowtime, average machine utilization, and average length of queue. This study has provided better understanding on the effects of changes in demand and capacity on the job shop schedules. Areas for further study includes: (i) Fine tune the proposed ANN scheduling model (ii) Consider more variety of job shop environment (iii) Incorporate an expert system for interpretation of results. The theoretical framework proposed in this study can be used as a basis for further investigation

Production Scheduling

Generally speaking, scheduling is the procedure of mapping a set of tasks or jobs (studied objects) to a set of target resources efficiently. More specifically, as a part of a larger planning and scheduling process, production scheduling is essential for the proper functioning of a manufacturing enterprise. This book presents ten chapters divided into five sections. Section 1 discusses rescheduling strategies, policies, and methods for production scheduling. Section 2 presents two chapters about flow shop scheduling. Section 3 describes heuristic and metaheuristic methods for treating the scheduling problem in an efficient manner. In addition, two test cases are presented in Section 4. The first uses simulation, while the second shows a real implementation of a production scheduling system. Finally, Section 5 presents some modeling strategies for building production scheduling systems. This book will be of interest to those working in the decision-making branches of production, in various operational research areas, as well as computational methods design. People from a diverse background ranging from academia and research to those working in industry, can take advantage of this volume

Analysing the impact of rescheduling time in hybrid manufacturing control

Hybrid manufacturing control architectures merge the benefits of hierarchical and heterarchical approaches. Disturbances can be handled at upper or lower decision levels, depending on the type of disturbance, its impact and the time the control system has to react. This paper focuses particularly on a disturbance handling mechanism at upper decision levels using a rescheduling manufacturing method. Such rescheduling is more complex that the offline scheduling since the control system must take into account the current system status, obtain a satisfactory performance under the new conditions, and also come up with a new schedule in a restricted amount of time. Then, this paper proposes a simple and generic rescheduling method which, based on the satisfying principle, analyses the trade-off between the rescheduling time and the performance achieved after a perturbation. The proposed approach is validated on a simulation model of a realistic assembly cell and results demonstrate that adaptation of the rescheduling time might be beneficial in terms of overall performance and reactivity.info:eu-repo/semantics/publishedVersio

Toward smart manufacturing scheduling from an ontological approach of job-shop uncertainty sources

[EN] An integral application of the enabling technologies of Industry 4.0 in the job-shop scheduling problem (JSSP) must contemplate the automation and autonomy of the involved decision-making processes as a goal, which is the main purpose of the smart manufacturing scheduling (SMS) paradigm. In a real production context, uncertainty acts as a barrier that hinders this goal being met and, therefore, any SMS model should integrate uncertainty generators in one way or another. This paper proposes an ontological framework that identifies and structures the entities shaping the joint domain formed by the job-shop scheduling process in its itinerary toward the SMS paradigm, the sources of uncertainty that it faces, and the interrelationship type that link these entities. This ontological framework will serve in future research as a conceptual basis to design new quantitative models that, from a holistic perspective, will address the stochasticity of manufacturing environments and incorporate the management of disturbances into the realtime resolution of automatic and autonomous job-shop scheduling.The research leading to these results received funding from grant RTI2018-101344-B-I00 of MCIN/AEI/10.13039/501100011033 and ¿ERDF A way of making Europe¿, from the Regional Department of Innovation, Universities, Science and Digital Society of the Generalitat Valenciana entitled "Industrial Production and Logistics Optimization in Industry 4.0" (i4OPT) (Ref. PROMETEO/2021/065)", and from the European Union H2020 programs with grant agreements No. 825631 ¿Zero-Defect Manufacturing Platform (ZDMP)¿, No. 872548 "Fostering DIHs for Embedding Interoperability in Cyber-Physical Systems of European SMEs (DIH4CPS)", and No. 958205 ¿Industrial Data Services for Quality Control in Smart Manufacturing (i4Q)¿.Serrano-Ruiz, JC.; Mula, J.; Poler, R. (2022). Toward smart manufacturing scheduling from an ontological approach of job-shop uncertainty sources. IFAC-PapersOnLine. 55(2):150-155. https://doi.org/10.1016/j.ifacol.2022.04.18515015555

Towards a conceptual design of intelligent material transport using artificial intelligence

Reliable and efficient material transport is one of the basic requirements that affect productivity in industry. For that reason, in this paper two approaches are proposed for the task of intelligent material transport by using a mobile robot. The first approach is based on applying genetic algorithms for optimizing process plans. Optimized process plans are passed to the genetic algorithm for scheduling which generate an optimal job sequence by using minimal makespan as criteria. The second approach uses graph theory for generating paths and neural networks for learning generated paths. The Matla

Koncepcijsko projektiranje inteligentnog unutarnjeg transporta materijala korištenjem umjetne inteligencije

Reliable and efficient material transport is one of the basic requirements that affect productivity in industry. For that reason, in this paper two approaches are proposed for the task of intelligent material transport by using a mobile robot. The first approach is based on applying genetic algorithms for optimizing process plans. Optimized process plans are passed to the genetic algorithm for scheduling which generate an optimal job sequence by using minimal makespan as criteria. The second approach uses graph theory for generating paths and neural networks for learning generated paths. The Matlab© software package is used for developing genetic algorithms, manufacturing process simulation, implementing search algorithms and neural network training. The obtained paths are tested by means of the Khepera II mobile robot system within a static laboratory model of manufacturing environment. The experiment results clearly show that an intelligent mobile robot can follow paths generated by using genetic algorithms as well as learn and predict optimal material transport flows thanks to using neural networks. The achieved positioning error of the mobile robot indicates that the conceptual design approach based on the axiomatic design theory can be used for designing the material transport and handling tasks in intelligent manufacturing systems.Pouzdan i efikasan transport materijala je jedan od ključnih zahtjeva koji utječe na povećanje produktivnosti u industriji. Iz tog razloga, u radu su predložena dva pristupa za inteligentan transport materijala korištenjem mobilnog robota. Prvi pristup se zasniva na primjeni genetskih algoritama za optimizaciju tehnoloških procesa. Optimalna putanja se dobiva korištenjem optimalnih tehnoloških procesa i genetskih algoritama za vremensko planiranje, uz minimalno vrijeme kao kriterij. Drugi pristup je temeljen na primjeni teorije grafova za generiranje putanja i neuronskih mreža za učenje generirane putanje. Matlab© softverski paket je korišten za razvoj genetskih algoritama, simulaciju tehnoloških procesa, implementaciju algoritama pretraživanja i obučavanje neuronskih mreža. Dobivene putanje su testirane pomoću Khepera II mobilnog robota u statičkom laboratorijskom modelu tehnološkog okruženja. Eksperimentalni rezultati pokazuju kako inteligentni mobilni robot prati putanje generirane korištenjem genetskih algoritama, kao i da uči i predviđa optimalne tokove materijala zahvaljujući neuronskim mrežama. Ostvarena pogreška pozicioniranja mobilnog robota ukazuje da se koncepcijski pristup baziran na aksiomatskoj teoriji projektiranja može koristiti u projektiranju transporta i manipulacije u inteligentnom tehnološkom sustavu

Towards a conceptual design of intelligent material transport using artificial intelligence

Reliable and efficient material transport is one of the basic requirements that affect productivity in industry. For that reason, in this paper two approaches are proposed for the task of intelligent material transport by using a mobile robot. The first approach is based on applying genetic algorithms for optimizing process plans. Optimized process plans are passed to the genetic algorithm for scheduling which generate an optimal job sequence by using minimal makespan as criteria. The second approach uses graph theory for generating paths and neural networks for learning generated paths. The Matla

Smart manufacturing scheduling: A literature review

[EN] Within the scheduling framework, the potential of digital twin (DT) technology, based on virtualisation and intelligent algorithms to simulate and optimise manufacturing, enables an interaction with processes and modifies their course of action in time synchrony in the event of disruptive events. This is a valuable capability for automating scheduling and confers it autonomy. Automatic and autonomous scheduling management can be encouraged by promoting the elimination of disruptions due to the appearance of defects, regardless of their origin. Hence the zero-defect manufacturing (ZDM) management model oriented towards zero-disturbance and zero-disruption objectives has barely been studied. Both strategies combine the optimisation of production processes by implementing DTs and promoting ZDM objectives to facilitate the modelling of automatic and autonomous scheduling systems. In this context, this particular vision of the scheduling process is called smart manufacturing scheduling (SMS). The aim of this paper is to review the existing scientific literature on the scheduling problem that considers the DT technology approach and the ZDM model to achieve self-management and reduce or eliminate the need for human intervention. Specifically, 68 research articles were identified and analysed. The main results of this paper are to: (i) find methodological trends to approach SMS models, where three trends were identified; i.e. using DT technology and the ZDM model, utilising other enabling digital technologies and incorporating inherent SMS capabilities into scheduling; (ii) present the main SMS alignment axes of each methodological trend; (iii) provide a map to classify the literature that comes the closest to the SMS concept; (iv) discuss the main findings and research gaps identified by this study. Finally, managerial implications and opportunities for further research are identified.This work was supported by the Spanish Ministry of Science, Innovation and Universities project entitled 'Optimisation of zero-defects production technologies enabling supply chains 4.0 (CADS4.0) ' (RTI2018-101344-B-I00) , the European Union H2020 research and innovation programme with grant agreement No. 825631 "Zero Defect Manufacturing Platform (ZDMP) " and the European Union H2020 research and innovation programme with agreement No. 958205 "In-dustrial Data Services for Quality Control in Smart Manufacturing (i4Q) ".Serrano-Ruiz, JC.; Mula, J.; Poler, R. (2021). Smart manufacturing scheduling: A literature review. Journal of Manufacturing Systems. 61:265-287. https://doi.org/10.1016/j.jmsy.2021.09.0112652876

A general framework integrating techniques for scheduling under uncertainty

Ces dernières années, de nombreux travaux de recherche ont porté sur la planification de tâches et l'ordonnancement sous incertitudes. Ce domaine de recherche comprend un large choix de modèles, techniques de résolution et systèmes, et il est difficile de les comparer car les terminologies existantes sont incomplètes. Nous avons cependant identifié des familles d'approches générales qui peuvent être utilisées pour structurer la littérature suivant trois axes perpendiculaires. Cette nouvelle structuration de l'état de l'art est basée sur la façon dont les décisions sont prises. De plus, nous proposons un modèle de génération et d'exécution pour ordonnancer sous incertitudes qui met en oeuvre ces trois familles d'approches. Ce modèle est un automate qui se développe lorsque l'ordonnancement courant n'est plus exécutable ou lorsque des conditions particulières sont vérifiées. Le troisième volet de cette thèse concerne l'étude expérimentale que nous avons menée. Au-dessus de ILOG Solver et Scheduler nous avons implémenté un prototype logiciel en C++, directement instancié de notre modèle de génération et d'exécution. Nous présentons de nouveaux problèmes d'ordonnancement probabilistes et une approche par satisfaction de contraintes combinée avec de la simulation pour les résoudre. ABSTRACT : For last years, a number of research investigations on task planning and scheduling under uncertainty have been conducted. This research domain comprises a large number of models, resolution techniques, and systems, and it is difficult to compare them since the existing terminologies are incomplete. However, we identified general families of approaches that can be used to structure the literature given three perpendicular axes. This new classification of the state of the art is based on the way decisions are taken. In addition, we propose a generation and execution model for scheduling under uncertainty that combines these three families of approaches. This model is an automaton that develops when the current schedule is no longer executable or when some particular conditions are met. The third part of this thesis concerns our experimental study. On top of ILOG Solver and Scheduler, we implemented a software prototype in C++ directly instantiated from our generation and execution model. We present new probabilistic scheduling problems and a constraintbased approach combined with simulation to solve some instances thereof