Research on Production Scheduling Problems in Process Industry Based on Ant Colony System

2010 ◽  
Vol 108-111 ◽  
pp. 519-524
Author(s):  
Lie Ping Zhang ◽  
Yun Sheng Zhang

In order to improve the production of process industry, the ant colony system(ACS) was applied to the production scheduling problem. Based on the analysis of the production scheduling problem for process industry, a production scheduling model was established, whose goal was to obtain the shortest total process time. The search strategy, heuristic information rules, pheromone updating mechanism, process step starting time and detailed algorithm implementation of ACS were discussed. Using a practical production scheduling problem as an example, the established model and designed algorithm were applied to implement the scheduling simulation. The simulation results show that the scheduling model and algorithm are feasible, and have a better scheduling performance than the stochastic scheduling method, and can be applied to solve practical production scheduling problem for process industry.

2012 ◽  
Vol 1 (2) ◽  
pp. 44 ◽  
Author(s):  
Nasser Shahsavari Pour ◽  
Mohammad hossein Abolhasani Ashkezari ◽  
Hamed Mohammadi Andargoli

During the past years, the flow shop has been regarded by many researchers and some extensive investigations have been done on this respect. Flow Shop includes n works performed on m machines in a same sequence. It is very difficult in the real world to determine the exact process time of an operation on a machine. Therefore, we consider in this article the process time as trapezoidal fuzzy numbers. Our purpose is that we obtain a sequence of works using such fuzzy numbers in order to minimize maximum fuzzy time of completion entire jobs or fuzzy makespan. We offered an optimization algorithm of Ant Colony System (ACS) to solve this problem. Finally, we present computational results for explanation and comparison with other articles in future.


Impact ◽  
2020 ◽  
Vol 2020 (8) ◽  
pp. 60-61
Author(s):  
Wei Weng

For a production system, 'scheduling' aims to find out which machine/worker processes which job at what time to produce the best result for user-set objectives, such as minimising the total cost. Finding the optimal solution to a large scheduling problem, however, is extremely time consuming due to the high complexity. To reduce this time to one instance, Dr Wei Weng, from the Institute of Liberal Arts and Science, Kanazawa University in Japan, is leading research projects on developing online scheduling and control systems that provide near-optimal solutions in real time, even for large production systems. In her system, a large scheduling problem will be solved as distributed small problems and information of jobs and machines is collected online to provide results instantly. This will bring two big changes: 1. Large scheduling problems, for which it tends to take days to reach the optimal solution, will be solved instantly by reaching near-optimal solutions; 2. Rescheduling, which is still difficult to be made in real time by optimization algorithms, will be completed instantly in case some urgent jobs arrive or some scheduled jobs need to be changed or cancelled during production. The projects have great potential in raising efficiency of scheduling and production control in future smart industry and enabling achieving lower costs, higher productivity and better customer service.


2020 ◽  
Vol 12 (4) ◽  
pp. 63-75
Author(s):  
Zhifeng Zhang ◽  
Yusheng Sun ◽  
Yadong Cui ◽  
Haodong Zhu

Production scheduling problems have historically emphasized cycle time without involving the environmental factors. In the study, a low-carbon scheduling problem in a flexible job shop is considered to minimize the energy consumption, which mainly consists of two parts: the useful part and the wasted part. First, a mathematical model is built based on the features of the workshop. Second, a modified migrating bird's optimization (MMBO) is developed to obtain the optimal solution. In the MMBO, a population initialization scheme is designed to enhance the solution quality and convergence speed. Five types of neighborhood structures are introduced to create neighborhood solutions. Furthermore, a local search method and a reset mechanism are developed to improve the computational results. Finally, experimental results validate that the MMBO is effective and feasible.


Processes ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 604 ◽  
Author(s):  
Yanyan Wang ◽  
Rongxu Zhang ◽  
Hui Liu ◽  
Xiaoqing Zhang ◽  
Ziwei Liu

As a new type of part-to-picker storage system, the double-deep multi-tier shuttle system has been developed rapidly in the e-commerce industry because of its high flexibility, large storage capacity, and robustness. The system consists of a multi-tier shuttle sub-system that controls horizontal movement and a lift sub-system that manages vertical movement. The combination of shuttles and lifts, instead of a stacker crane in conventional automated storage and retrieval system, undertakes inbound/outbound tasks. Because of the complex structure and numerous equipment of the system, task scheduling has become a major difficulty in the outbound operation of the double-deep multi-tier shuttle system. Figuring out methods to improve the overall efficiency of task scheduling operations is the focus of current system application enterprises. This paper introduces the task scheduling problem for the shuttle system. Inspired from workshop production scheduling problems, we minimize the total time of a batch of retrieval tasks as the objective function, applying the modified Simulated Annealing Algorithms (SAAs) to solve the task scheduling problem. In conclusion, we verified the proposed model and the algorithm efficiency, using case studies.


2013 ◽  
Vol 860-863 ◽  
pp. 3094-3099 ◽  
Author(s):  
Bao Lin Zhu ◽  
Shou Feng Ji

Iron and steel production scheduling problems are different from general production scheduling in machine industry. They have to meet special demands of steel production process. The CCR production manner dramatically promotes the revolution in technology and management, especially to planning and scheduling. In this paper, a scheduling model is presented to integrate the three working procedures and the lagrangian relaxation technology is proposed to get the optimal solution of the scheduling model. Finally, numerical examples are given to demonstrate the effectiveness of the integrated model and method.


2020 ◽  
pp. 004051752094889
Author(s):  
Wentao He ◽  
Shuo Meng ◽  
Jing’an Wang ◽  
Lei Wang ◽  
Ruru Pan ◽  
...  

Weaving enterprises are faced with problems of small batches and many varieties, which leads to difficulties in manual scheduling during the production process, resulting in more delays in delivery. Therefore, an automatic scheduling method for the weaving process is proposed in this paper. Firstly, a weaving production scheduling model is established based on the conditions and requirements during actual production. By introducing flexible model constraints, the applicability of the model has been greatly expanded. Then, an improved ant colony algorithm is proposed to solve the model. To address the problem of the traditional ant colony algorithm that the optimizing process usually traps into local optimum, the proposed algorithm adopts an iterative threshold and the maximum and minimum ant colony system. In addition, the initial path pheromone distribution is formed according to the urgency of the order to balance each objective. Finally, the simulation experiments confirm that the proposed method achieves superior performance compared with manual scheduling and other automatic methods. The proposed method shows a certain guiding significance for weaving scheduling in practice.


Sign in / Sign up

Export Citation Format

Share Document