"Industry 4.0" term is devoted to the fourth industrial revolution. Over time and by developing different technologies, this term is coming with the new paradigm and technologies, which help to connect the machines, products, and methods as an interconnected system. This paper aims to introduce an analysis and a reflection around the concepts industry 4.0 and their impacts in the actual industrial world. The effects of this digitalization will be investigated on supply chain systems, decision-making processes, and business models. The classic supply chain is evolving into a Network Supply System (NSS) that is an interconnected supply chain with more focus on product and customer expectations. The global value chain process tends to be product-oriented. Smart data make the decisions more dynamic, flexible, and precise. Therefore, every industrial sector has to be adapted to this digital transformation in all aspects. However, the environmental aspects, global warming, and human healthcare issues are the challenge facing industries and human life, which can be like a brake to make efforts to improve digital life and machine technicity. This paper tries to produce a critical analysis of the concept "industry 4.0 revolution" based on different guidelines to show that it is an evolution of the industry coming through the development of several technologies.

No abstract

No abstract

This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graphbased and sequence-based, of the well-known scheduling problem | , | m j ij j P r s C∑ . Two upper bounds of job completion times are introduced.A numerical test result analysis is conducted with a two-fold objective 1) testing the performance of each solving methods, and 2) identifying and analyzing the tractability of an instance according to the instance structure in terms of the number of machines, of the jobs setup time lengths and of the jobs release date distribution over the scheduling horizon.

In this paper, we study a complex outpatient planning problem in the chemotherapy department. The planning concerns sequences of patients’ treatment sessions subject to exact in-between resting periods (i.e., exact time-lags). The planning is constrained by the hospital infrastructure and the availability of medical staff (i.e., multiple time-varying resources’ availability). In order to maximize the patients’ service quality, the objective of the function considered is to minimize the total wait times, which is equivalent to the criteria for minimizing the total completion time. Our main contribution is a thorough analysis of this problem, using the Hybrid Flow Shop problem as a theoretical framework to study the problem. A novel Mixed Integer Linear Programming (MILP) is introduced. Concerning the resolution methods, priority-based heuristics and an adapted genetic algorithm (GA) are presented. Numerical experiments are conducted on historical data to compare the performances of the approximate resolution methods against the MILP solved by CPLEX. Numerical results confirm the performances of the proposed methods.