Metaheuristic algorithms for the flexible job-shop scheduling problem (original) (raw)
2020, IMK-14 - Istrazivanje i razvoj
The problem with flexible job planning (FJSP) is a modification o f the classic job booking problem. This paper deals with the problem o f flexible job deployment and processing o f operations on one machine from a set o f alternative machines. The problem o f deploying flexible jobs in real time is one o f a group o f difficult NP problems (Non-deterministic polynomial time). The motive o f this paper is to show the application o f meta-heuristic algorithms on the example of flexible job schedules and present the appropriate method to future studies. To solve this problem, two meta-heuristic algorithms were used: Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC). The aim o f the paper is to achieve the speed o f the conversion solution in a series o f iterations, minimizing the total time o f deployment of jobs on an alternative set of machines, as well as minimizing the total schedule time. The problem o f deploying flexible jobs has great application, and with thi...
Related papers
Artificial Bee Colony Algorithm Applied to Dynamic Flexible Job Shop Problems
Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2020
This work introduces a scheduling technique using the Artificial Bee Colony (ABC) algorithm for static and dynamic environments. The ABC algorithm combines different initial populations and generation of new food source methods, including a moving operations technique and a local search method increasing the variable neighbourhood search that, as a result, improves the solution quality. The algorithm is validated and its performance is tested in a static environment in 9 instances of Flexible Job Shop Problem (FJSP) from Brandimarte dataset obtaining in 5 instances the best known for the instance under study and a new best known in instance mk05. The work also focus in developing tools to process the information on the factory through the development of solutions when facing disruptions and dynamic events. Three real-time events are considered on the dynamic environment: jobs cancellation, operations cancellation and new jobs arrival. Two scenarios are studied for each real-time eve...
An Efficient Heuristic Algorithm for Solving Flexible Job Shop Scheduling Problem
An efficient heuristic algorithm for solving the Flexible Job Shop Scheduling Problem is presented and it is called artificial intelligence (A1) algorithm. AI is a new construction heuristic technique. It is mainly depending upon a new heuristic rule that has the capability for establishing feasible solutions. First Out First In, the new heuristic rule, is designed for minimizing the makespan of the Flexible Job Shop Scheduling Problem. The Flexible Job Shop Scheduling Problem is known as NP-hard combinatorial optimization problem that has long challenged researchers. Makespan is the maximum completion time of achieving all the jobs. Some problems from references are solved using the proposed algorithm and an implementation study is presented. The implementation study shows the efficiency of the proposed algorithm with respect to the tested problem.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.