Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 688 ◽  
Author(s):  
Fei Luan ◽  
Zongyan Cai ◽  
Shuqiang Wu ◽  
Shi Qiang Liu ◽  
Yixin He

The flexible job shop scheduling problem (FJSP) is a difficult discrete combinatorial optimization problem, which has been widely studied due to its theoretical and practical significance. However, previous researchers mostly emphasized on the production efficiency criteria such as completion time, workload, flow time, etc. Recently, with considerations of sustainable development, low-carbon scheduling problems have received more and more attention. In this paper, a low-carbon FJSP model is proposed to minimize the sum of completion time cost and energy consumption cost in the workshop. A new bio-inspired metaheuristic algorithm called discrete whale optimization algorithm (DWOA) is developed to solve the problem efficiently. In the proposed DWOA, an innovative encoding mechanism is employed to represent two sub-problems: Machine assignment and job sequencing. Then, a hybrid variable neighborhood search method is adapted to generate a high quality and diverse population. According to the discrete characteristics of the problem, the modified updating approaches based on the crossover operator are applied to replace the original updating method in the exploration and exploitation phase. Simultaneously, in order to balance the ability of exploration and exploitation in the process of evolution, six adjustment curves of a are used to adjust the transition between exploration and exploitation of the algorithm. Finally, some well-known benchmark instances are tested to verify the effectiveness of the proposed algorithms for the low-carbon FJSP.


Author(s):  
Saso Srsen ◽  
Marjan Mernik

A Job Shop Scheduling Problem (JSSP), where p processes and n jobs should be processed on m machines so that the total completion time is minimal, is a well-known problem with many industrial applications. Many researchers focus on the JSSP classification and algorithms that address the different JSSP classes. In this research work, the production times, a very well-known theme covered in Industrial Engineering (IE), are integrated into an Evolutionary Algorithm (EA) to solve real-world JSSP problems. Since a drawback of classical IE is a manual determination of the technological times, an Internet of Things (IoT) architecture is proposed as a possible solution.


2011 ◽  
Vol 121-126 ◽  
pp. 4547-4551
Author(s):  
Li Xin Qi ◽  
Ze Tao

A new dual-objective scheduling method based on the controlled Petri net and GA is proposed to the job-shop scheduling problem (JSP) constrained by machines, workers. Firstly, a detailed analysis of supervisory control for Petri net with uncontrollable transitions, especially important, for OR-logics linear constraint, a new method for constructing a Petri net feedback controller based on monitor and inhibitor arcs is presented. The Petri net model is constructed based on above method in flexible JSP. Then, the genetic algorithm (GA) is applied based on the controlled Petri net model and Pareto. Function objectives of the proposed method are to minimize the completion time and the total expense of machines and workers. Finally, Scheduling example is employed to illustrate the effectiveness of the method.


2011 ◽  
Vol 48-49 ◽  
pp. 824-829
Author(s):  
Tao Ze ◽  
Xiao Xia Liu

A new dual-objective scheduling method based on the controlled Petri net and GA is proposed to the job-shop scheduling problem (JSP) with urgent orders constrained by machines, workers. Firstly, a controller designed method for Petri net with uncontrollable transition is introduced, and based on the method, the Petri net model is constructed for urgent jobs in flexible job shop scheduling problem. Then, the genetic algorithm (GA) is applied based on the controlled Petri net model and Pareto. Function objectives of the proposed method are to minimize the completion time and the total expense of machines and workers. Finally, Scheduling example is employed to illustrate the effectiveness of the method.


2006 ◽  
Vol 182 (2) ◽  
pp. 1137-1148 ◽  
Author(s):  
Fawaz S. Al-Anzi ◽  
Yuri N. Sotskov ◽  
Ali Allahverdi ◽  
George V. Andreev

Author(s):  
Aidin Delgoshaei ◽  
Aisa Khoshniat Aram ◽  
Alireza Rezanoori ◽  
Sepehr Esmaeili Hanjani ◽  
Golnaz Hooshmand Pakdel ◽  
...  

In real industries, managers usually consider more than one objective in scheduling process. Minimizing completion time, operational costs and average of machine loads are amongst the main concerns of managers during production scheduling in practice. The purpose of this research is to develop a new scheduling method for job-shop systems in the presence of uncertain demands while optimizing completion time, operational costs and machine load average are taken into account simultaneously. In this research a new multi-objective nonlinear mixed integer programming method is developed for job-shop scheduling in the presence of product demand uncertainty. The objectives of the proposed method are minimizing cost, production time and average of machine loads index. To solve the model, a hybrid NSGA-II and Simulated Annealing algorithms is proposed where the core of the solving algorithm is set based on weighting method. In continue a Taguchi method is set for design of experiments and also estimate the best initial parameters for small, medium and large scale case studies. Then comprehensive computational experiments have been carried out to verify the effectiveness of the proposed solution approaches in terms of the quality of the solutions and the solving times. The outcomes are then compared with a classic Genetic Algorithm. The outcomes indicated that the proposed algorithm could successfully solve large-scale experiments less than 2 minutes (123 seconds) that is noticeable. While performance of the solving algorithm are taken into consideration, the proposed algorithm could improve the outcomes in a range between 9.07% and 64.96% depending on the input data. The results also showed that considering multi-objective simultaneously more reasonable results would be reached in practice. The results showed that the market demand uncertainty can significantly affect to the process of job shop scheduling and impose harms in manufacturing systems both in terms of completion time and machine load variation. Operational costs, however, did not reflect significantly to market demand changes. The algorithm is then applied for a manufacturing firm. The outcomes showed that the proposed algorithm is flexible enough to be used easily in real industries.


Sign in / Sign up

Export Citation Format

Share Document