| Article ID: | iaor20022797 |
| Country: | United Kingdom |
| Volume: | 40 |
| Issue: | 4 |
| Start Page Number: | 809 |
| End Page Number: | 824 |
| Publication Date: | Jan 2002 |
| Journal: | International Journal of Production Research |
| Authors: | Choi S., Silver E.A., Moon I. |
| Keywords: | genetic algorithms |
The economic lot-scheduling problem (ELSP) is an important production scheduling problem that has been intensively studied over 40 years. Numerous heuristic algorithms have been developed since the problem is NP-hard. Dobson's heuristic has been regarded as the best in its performance. The present paper provides a hybrid genetic algorithm based on the time-varying lot sizes approach in the ELSP literature. Numerical experiments show that the hybrid genetic algorithm outperforms Dobson's heuristic.