𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithm for the Job Shop Scheduling Problem based on Global Equilibrium Search Techniques

✍ Scribed by Panos M. Pardalos; Oleg V. Shylo

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
693 KB
Volume
3
Category
Article
ISSN
1619-697X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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