A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem

Authors: not saved
Abstract:

Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the JSSP by minimizing the makespan. This approach is applied to several instances of a variety of benchmarks and the experimental results show that it produces nearly optimal solutions, compared with other approaches.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

An Approach Of Cellular Learning Automata To Job Shop Scheduling Problem

The Job shop scheduling problem (JSSP) is one of the NP-Hard combinatorial optimization problems. During the last four decades, many researches were devoted on this problem. The goal in the problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolve Cellular Learning Automata (CLA) to make it able to solve the JSSP by minimizing the make...

full text

A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem

This paper describes a genetic algorithm approach to the dynamic job shop scheduling problem with jobs arriving continually. Both deterministic and stochastic models of the dynamic problem were investigated. The objective functions examined were weighted flow time, maximum tardiness, weighted tardiness, weighted lateness, weighted number of tardy jobs, and weighted earliness plus weighted tardi...

full text

A Reinforcement Learning Approach to job-shop Scheduling

We apply reinforce merit learning methods to learn domain-specific heuristics for job shop scheduling A repair-based scheduler starts with a critical-path schedule and incrementally repairs constraint violations with the goal of finding a short conflict-free schedule The tem poral difference algorithm is applied to tram a neural network to learn a heuristic evaluation function over s ta tes Thi...

full text

Preemptive Job-Shop Scheduling Using Stopwatch Automata

In this paper we show how the problem of job-shop scheduling where the jobs are preemptible can be modeled naturally as a shortest path problem defined on an extension of timed automata, namely stopwatch automata where some of the clocks might be freezed at certain states. Although general verification problems on stopwatch automata are known to be undecidable, we show that due to particular pr...

full text

Job-Shop Scheduling Using Timed Automata

In this paper we show how the classical job shop scheduling problem can be modeled as a special class of acyclic timed automata Finding an optimal schedule corresponds then to nding a shortest in terms of elapsed time path in the timed automaton This representa tion provides new techniques for solving the optimization problem and more importantly it allows to model naturally more complex dynami...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume Volume 2  issue Issue 4

pages  71- 78

publication date 2009-09-29

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