A real-time schedule method for Aircraft Landing Scheduling problem based on Cellular Automation

2011 ◽  
Vol 11 (4) ◽  
pp. 3485-3493 ◽  
Author(s):  
Sheng-Peng Yu ◽  
Xian-Bin Cao ◽  
Jun Zhang
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.


2016 ◽  
Vol 4 (1) ◽  
pp. 48-60 ◽  
Author(s):  
Yaroslav Shepilov ◽  
Daria Pavlova ◽  
Daria Kazanskaia

The scheduling is the process of the optimal resource allocation that is widely used both in everyday life and specific domains. In the paper the description of scheduling problem is given. The authors consider traditional methods and tools for solving this problem, then describe the proposed approach based on multi-agent technologies and multithreading application. Nowadays there exist numerous approaches to solving of the scheduling problem. In the most of cases this process has to be supported and managed by the complex tools, sometimes based on mathematical principles. The suggested method of multithreading multi-agent scheduling allows efficient and fast solution of complex problems in real-time featuring rapid dynamic changes and uncertainty that cannot be handled by the other methods and tools.


2019 ◽  
Vol 50 (15) ◽  
pp. 2733-2751 ◽  
Author(s):  
Haichao Hong ◽  
Arnab Maity ◽  
Florian Holzapfel ◽  
Shengjing Tang

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Eunji Lee ◽  
Hyokyung Bahn

With the recent advances in smart grid technologies as well as the increasing dissemination of smart meters, the electricity usage of every moment can be detected in modern smart building environments. Thus, the utility company adopts different price of electricity at each time slot considering the peak time. This paper presents a new electricity usage scheduling algorithm for smart buildings that adopts real-time pricing of electricity. The proposed algorithm detects the change of electricity prices by making use of a smart device and changes the power mode of each electric device dynamically. Specifically, we formulate the electricity usage scheduling problem as a real-time task scheduling problem and show that it is a complex search problem that has an exponential time complexity. An efficient heuristic based on genetic algorithms is performed on a smart device to cut down the huge searching space and find a reasonable schedule within a feasible time budget. Experimental results with various building conditions show that the proposed algorithm reduces the electricity charge of a smart building by 25.6% on average and up to 33.4%.


Sign in / Sign up

Export Citation Format

Share Document