Hybrid genetic algorithm for the economic lot-scheduling problem

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.