𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel machine scheduling problems using memetic algorithms

✍ Scribed by Runwei Cheng; Mitsuo Gen

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
309 KB
Volume
33
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we investigate how to apply the hybrid genetic algorithms (the memetiΒ’ algorithms) to solve the parallel machine scheduling problem. There are two essential issues to be dealt with for all kinds of parallel machine scheduling problems: job partition among machines and job sequence within each machine. The basic idea of the proposed method is that (a) use the genetic algorithms to evolve the job partition and then (b) apply a local optimiser to adjust the job permutation to push each chromosome climb to his local optima. Preliminaxy computational experiments demonstrate that the hybrid genetic algorithm outperforms the genetic algorithms and the conventional heuristics.

πŸ“œ SIMILAR VOLUMES

Clonal Selection Based Memetic Algorithm
Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems
✍ Jin-hui Yang; Liang Sun; Heow Pueh Lee; Yun Qian; Yan-chun Liang πŸ“‚ Article πŸ“… 2008 πŸ› SciencePress (China) 🌐 English βš– 591 KB

A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hyp

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

Polynomial time approximation algorithms
Polynomial time approximation algorithms for machine scheduling: ten open problems
✍ Petra Schuurman; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 91 KB πŸ‘ 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy