A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem

2008 ◽  
Vol 46 (11) ◽  
pp. 3027-3058 ◽  
Author(s):  
Wang Shi-Jin ◽  
Zhou Bing-Hai ◽  
Xi Li-Feng
Keyword(s):  
Heuristic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Beam Search ◽  
Shop Scheduling

Filtered Beam Search Based Flexible Job Shop Scheduling Problem with Transportation Time

2010 ◽  
Vol 97-101 ◽  
pp. 2440-2443
Author(s):  
Shi Jin Wang
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Beam Search ◽  
Transportation Time ◽  
Practical Applications ◽  
Shop Scheduling

Classical flexible job-shop scheduling problem (FJSP) does not consider the transportation time of jobs movement among different machines, which reduces the potential significance of its practical applications. This paper defines an FJSP problem with transportation time incurred by movement of jobs with one Automated Guided Vehicle (AGV) and one Load/Unload (L/U) station. A filtered beam search (FBS) based meta-heuristic algorithm is presented to solve this problem. The detailed procedure of the algorithm is described, and an example is shown to illustrate the algorithm. Finally, preliminary experimental results with comparisons of other dispatching rules demonstrate the feasibility and effectiveness of the proposed algorithm for the FJSP with transportation time.

Introducing an effective meta-heuristic algorithm: Cosmogony algorithm (CA)

2020 ◽  
Vol 39 (3) ◽  
pp. 3475-3501
Author(s):  
Nasser Shahsavari-Pour ◽  
Hamed Mohammadi-Andargoli ◽  
Najmeh Bahram-Pour
Keyword(s):  
Heuristic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
The Other ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Multi Objective

The purpose of this paper is to introduce a new meta-heuristic algorithm and apply this for solving a multi-objective flexible job-shop scheduling problem. The name of this algorithm is Cosmogony (CA). This algorithm has inspired by the ecosystem process of creatures and their environment. For a better understanding, we make an effort to apply the concepts of the meta-heuristic algorithms up to a possible extent. This algorithm identifies local optimal points during the self-search process of problem-solving. Initial creatures have been generated randomly in a certain number. This algorithm incorporates many features of the other algorithms in itself. So that to prove the ability and efficiency of CA, a flexible job-shop scheduling problem has surveyed. This problem is in a Non-resumable situation with maintenance activity constraints in a two-time fixed and non-fixed state. The algorithm performance is evaluated by numerical experiments. The result has shown the proposed approach is more efficient and appropriate than the other methods. It also has high power in the searching process in the feasible region of the multi-objective flexible job-shop scheduling problem and high converge power.

Sign in / Sign up

Export Citation Format

Share Document