A hybrid heuristic for agent-based scheduling problem with an ordinal scale objective criterion

Author(s):  
Yuan-Po Chao ◽  
Shuenn-Ren Cheng ◽  
Cheng-Hsiung Shih ◽  
Kejian Yu ◽  
Peng-Hsiang Hsu ◽  
...  
Processes ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 219
Author(s):  
Xiang Tian ◽  
Xiyu Liu

In real industrial engineering, job shop scheduling problem (JSSP) is considered to be one of the most difficult and tricky non-deterministic polynomial-time (NP)-hard problems. This study proposes a new hybrid heuristic algorithm for solving JSSP inspired by the tissue-like membrane system. The framework of the proposed algorithm incorporates improved genetic algorithms (GA), modified rumor particle swarm optimization (PSO), and fine-grained local search methods (LSM). To effectively alleviate the premature convergence of GA, the improved GA uses adaptive crossover and mutation probabilities. Taking into account the improvement of the diversity of the population, the rumor PSO is discretized to interactively optimize the population. In addition, a local search operator incorporating critical path recognition is designed to enhance the local search ability of the population. Experiment with 24 benchmark instances show that the proposed algorithm outperforms other latest comparative algorithms, and hybrid optimization strategies that complement each other in performance can better break through the original limitations of the single meta-heuristic method.


2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Shicheng Hu ◽  
Tengjiao Liu ◽  
Song Wang ◽  
Yonggui Kao ◽  
Xuedong Sun

Ship block construction space is an important bottleneck resource in the process of shipbuilding, so the production scheduling optimization is a key technology to improve the efficiency of shipbuilding. With respect to ship block construction space scheduling problem, a hybrid heuristic algorithm is proposed in this paper. Firstly, Bottom-Left-Fill (BLF) process is introduced. Next, an initial solution is obtained by guiding the sorting process with corners. Then on the basis of the initial solution, the simulated annealing arithmetic (SA) is used to improve the solution by offering a possibility to accept worse neighbor solutions in order to escape from local optimum. Finally, the simulation experiments are conducted to verify the effectiveness of the algorithm.


2019 ◽  
Vol 52 (13) ◽  
pp. 535-540
Author(s):  
M. Bamoumen ◽  
S. Belil ◽  
S. Elfirdoussi ◽  
L. Ren ◽  
N. Tchernev

2018 ◽  
Vol 18 (02) ◽  
pp. e14
Author(s):  
Laura Tosselli ◽  
Verónica Bogado ◽  
Ernesto Martínez

In a multi-project context within enterprise networks, reaching feasible solutions to the (re)scheduling problem represents a major challenge, mainly when scarce resources are shared among projects. The multi-project (re)scheduling must achieve the most efficient possible resource usage without increasing the prescribed project constraints, considering the Resource Leveling Problem (RLP), whose objective is to level the consumption of resources shared in order to minimize their idle times and to avoid overallocation conflicts. In this work, a multi-agent solution that allows solving the Resource Constrained Multi-project Scheduling Problem (RCMPSP) and the Resource Investment Problem is extended to incorporate indicators on agents’ payoff functions to address the Resource Leveling Problem in a decentralized and autonomous way, through decoupled rules based on Trial-and-Error approach. The proposed agent-based simulation model is tested through a set of project instances that vary in their structure, parameters, number of resources shared, etc. Results obtained are assessed through different scheduling goals, such as project total duration, project total cost and leveling resource usage. Our results are far better compared to the ones obtained with alternative approaches. This proposal shows that the interacting agents that implement decoupled learning rules find a solution which can be understood as a Nash equilibrium.


Sign in / Sign up

Export Citation Format

Share Document