๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Solving parallel machines job-shop scheduling problems by an adaptive algorithm

โœ Scribed by Gholami, Omid; Sotskov, Yuri N.


Book ID
121412177
Publisher
Taylor and Francis Group
Year
2013
Tongue
English
Weight
533 KB
Volume
52
Category
Article
ISSN
0020-7543

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An efficient memetic algorithm for solvi
โœ 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