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

An interactive approach for a dual-constraint job shop scheduling problem

โœ Scribed by Suna Kondakci; Rajiv M. Gupta

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
644 KB
Volume
20
Category
Article
ISSN
0360-8352

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