𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An agent-based parallel approach for the job shop scheduling problem with genetic algorithms

✍ Scribed by Leila Asadzadeh; Kamran Zamanifar

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
599 KB
Volume
52
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An agent-based parallel approach for the
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
✍ Leila Asadzadeh; Kamran Zamanifar πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 599 KB

The job shop scheduling problem is one of the most important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate s

An efficient memetic algorithm for solvi
An efficient memetic algorithm for solving the job shop scheduling problem
✍ Liang Gao; Guohui Zhang; Liping Zhang; Xinyu Li πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 741 KB

## a b s t r a c t The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an eff

A simulated annealing algorithm for the
A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts
✍ Atabak Elmi; Maghsud Solimanpur; Seyda Topaloglu; Afshin Elmi πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 444 KB

This paper addresses the problem of scheduling parts in job shop cellular manufacturing systems by considering exceptional parts that need to visit machines in different cells and reentrant parts which need to visit some machines more than once in non-consecutive manner. Initially, an integer linear