Solving Job Shop Scheduling Problem Using Cellular Learning Automata

Abstract

Cellular Learning Automata (CLA) is one of the newest optimization methods for solving NP-hard problems. The Job Shop Scheduling Problem (JSSP) is one of these problems. This paper, proposes a new approach for solving the JSSP using CLA with two kinds of actions' set. By generating actions based on received responses from the problem environment… (More)
DOI: 10.1109/EMS.2009.68

Topics

8 Figures and Tables

Cite this paper

@article{Abdolzadeh2009SolvingJS, title={Solving Job Shop Scheduling Problem Using Cellular Learning Automata}, author={Masoud Abdolzadeh and Hassan Rashidi}, journal={2009 Third UKSim European Symposium on Computer Modeling and Simulation}, year={2009}, pages={49-54} }