𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for a job shop problem

✍ Scribed by Wieslaw Kubiak; Suresh Sethi; Chelliah Sriskandarajah

Book ID
112693302
Publisher
Springer US
Year
1995
Tongue
English
Weight
861 KB
Volume
57
Category
Article
ISSN
0254-5330

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

A genetic algorithm for the job shop pro
A genetic algorithm for the job shop problem
✍ Federico Della Croce; Roberto Tadei; Giuseppe Volta πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 704 KB