A Neighborhood Selection Strategy for Production Scheduling using CP and LNS

Author(s):  
Max Astrand ◽  
Mikael Johansson
Electronics ◽  
2022 ◽  
Vol 11 (2) ◽  
pp. 184
Author(s):  
Yongkun Zhou ◽  
Dan Song ◽  
Bowen Ding ◽  
Bin Rao ◽  
Man Su ◽  
...  

In system science, a swarm possesses certain characteristics which the isolated parts and the sum do not have. In order to explore emergence mechanism of a large–scale electromagnetic agents (EAs), a neighborhood selection (NS) strategy–based electromagnetic agent cellular automata (EA–CA) model is proposed in this paper. The model describes the process of agent state transition, in which a neighbor with the smallest state difference in each sector area is selected for state transition. Meanwhile, the evolution rules of the traditional CA are improved, and performance of different evolution strategies are compared. An application scenario in which the emergence of multi–jammers suppresses the radar radiation source is designed to demonstrate the effect of the EA–CA model. Experimental results show that the convergence speed of NS strategy is better than those of the traditional CA evolution rules, and the system achieves effective jamming with the target after emergence. It verifies the effectiveness and prospects of the proposed model in the application of electronic countermeasures (ECM).


Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2256
Author(s):  
Xiaowu Chen ◽  
Guozhang Jiang ◽  
Yongmao Xiao ◽  
Gongfa Li ◽  
Feng Xiang

Intelligent manufacturing is the trend of the steel industry. A cyber-physical system oriented steel production scheduling system framework is proposed. To make up for the difficulty of dynamic scheduling of steel production in a complex environment and provide an idea for developing steel production to intelligent manufacturing. The dynamic steel production scheduling model characteristics are studied, and an ontology-based steel cyber-physical system production scheduling knowledge model and its ontology attribute knowledge representation method are proposed. For the dynamic scheduling, the heuristic scheduling rules were established. With the method, a hyper-heuristic algorithm based on genetic programming is presented. The learning-based high-level selection strategy method was adopted to manage the low-level heuristic. An automatic scheduling rule generation framework based on genetic programming is designed to manage and generate excellent heuristic rules and solve scheduling problems based on different production disturbances. Finally, the performance of the algorithm is verified by a simulation case.


Author(s):  
Rosnani Ginting ◽  
Chairul Rahmadsyah Manik

Penjadwalan merupakan aspek yang sangat penting karena didalamnya terdapat elemen perencanaan dan pengendalian produksi bagi suatu perusahaan yang dapat mengirim barang sesuai dengan waktu yang telah ditentukan, untuk memperoleh waktu total penyelesaian yang minimum. Masalah utama yang dihadapi oleh PT. ML adalah keterlambatan penyelesaian order yang mempengaruhi delivery time ke tangan costumer karena pelaksanaan penjadwalan produksi dilantai pabrik belum menghasilkan makespan yang sesuai dengan order yang ada. Oleh kaena itu dituntut untuk mencari solusi pemecahan masalah optimal dalam penentuan jadwal produksi untuk meminimisasi total waktu penyelessaian (makespan) semua order. Dalam penelitian ini, penjadwalan menggunakan metode Simulated Annealing (SA) diharapkan dapat menghasilkan waktu total penyelesaian lebih cepat dari penjadwalan yang ada pada perusahaan.   Scheduling is a very important aspect because in it there are elements of planning and production control for a company that can send goods in accordance with a predetermined time, to obtain a minimum total time of completion. The main problem faced by PT. ML is the delay in completing orders that affect delivery time to customer because the implementation of production scheduling on the factory floor has not produced the makespan that matches the existing order. Therefore, it is required to find optimal problem solving solutions in determining the production schedule to minimize the total time of elimination (makespan) of all orders. In this study, scheduling using the Simulated Annealing (SA) method is expected to produce a total time of completion faster than the existing scheduling in the company.


2018 ◽  
Vol 0 (0) ◽  
pp. 0 ◽  
Author(s):  
Marcel JOLY ◽  
Darci ODLOAK ◽  
MarioY. MIYAKE ◽  
Brenno C. MENEZES ◽  
Jeffrey D. KELLY

Sign in / Sign up

Export Citation Format

Share Document