A multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems

Authors

  • M.H Fazel Zarandi
  • M.H Karimi Gavareshki
Abstract:

This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search approach is presented. The schedule management agent can manage the system. Finally, the proposed agent based system is tested and validated by some benchmark problems. The results show the superiority of the proposed system in terms of makespan minimization and CPU times.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems

Flexible job shop scheduling problem (fJSP) is an extension of the classical job shop scheduling problem, which provides a closer approximation to real scheduling problems. This paper addresses the fJSP problem with three objectives: min makespan, min maximal machine workload and min total workload. We develop a new genetic algorithm hybridized with an innovative local search procedure (bottlen...

full text

A tabu search method guided by shifting bottleneck for the job shop scheduling problem

A computationally e ective heuristic method for solving the minimum makespan problem of job shop scheduling is presented. The proposed local search method is based on a tabu search technique and on the shifting bottleneck procedure used to generate the initial solution and to re ne the next-current solutions. Computational experiments on a standard set of problem instances show that, in several...

full text

Using Multi-Agent System for Dynamic Job Shop Scheduling

Today’s industries need more flexible scheduling systems able to produce new valid schedule in response to the modifications concerning orders, production processes and deliveries of materials. This paper introduces a multi-agent system applied to a job shop dynamic scheduling problem in which new production orders or deliveries arrive continuously and affect the already scheduled plan. We have...

full text

Multi-Agent Approach Based on Tabu Search for the Flexible Job Shop Scheduling Problem

This paper proposes a Multi-agent approach based on a tabu search method for solving the flexible Job Shop scheduling problem. The characteristic of the latter problem is that one or several machines can process one operation so that its processing time depends on the machine used. Such a generalization of the classical problem makes it more and more difficult to solve. The objective is to mini...

full text

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

full text

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 43  issue 1

pages  7- 15

publication date 2011-04-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023