# Solving University Scheduling Problem with a Memetic Algorithm

@inproceedings{Abbaszadeh2012SolvingUS, title={Solving University Scheduling Problem with a Memetic Algorithm}, author={Mortaza Abbaszadeh and Saeed Saeedvand and Hamid Asbagi Mayani}, year={2012} }

- Published 2012
DOI:10.11591/ij-ai.v1i2.512

Received May 31, 2012 Revised Jun 8, 2012 Accepted Jun 15, 2012 Scheduling problem is one of the Non-deterministic Polynomial (NP) problems. This means that using a normal algorithm to solve NP problems is so time-consuming a process (it may take months or even years with available equipment), and thus such an algorithm is regarded as an impracticable way of dealing with NP problems. The m thod of Memetic Algorithm presented in this paper is different from other available algorithms. In this… CONTINUE READING

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-6 of 6 references

## A Memetic Algorithm for a Break Scheduling Problem

View 1 Excerpt