𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for the job-shop problem with two jobs

✍ Scribed by P. Brucker

Publisher
Springer Vienna
Year
1988
Tongue
English
Weight
349 KB
Volume
40
Category
Article
ISSN
0010-485X

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