A comparative study of heuristic algorithms on Economic Lot Scheduling Problem

Authors:
Asif S. Raza;Ali Akgunduz
Affiliations:
Department of Mechanical and Industrial Engineering, Concordia University, 1455 de Maisonneuve Blvd., West, Montréal Que., Canada H3G 1M8;Department of Mechanical and Industrial Engineering, Concordia University, 1455 de Maisonneuve Blvd., West, Montréal Que., Canada H3G 1M8
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 8
Cited 3

The economic lot-scheduling problem: achieving feasibility using time-varying lot sizes

Operations Research
Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems

Management Science
Computing optimal lot sizes in the economic lot scheduling problem

Operations Research
The effect of externalizing setups in the economic lot scheduling problem

Operations Research
The cyclic lot scheduling problem with sequence dependent setups

Operations Research
Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
A tabu search algorithm for solving economic lot scheduling problem

Journal of Heuristics
Applying genetic algorithms to dynamic lot sizing with batch ordering

Computers and Industrial Engineering

A variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems

Computers and Industrial Engineering
Modeling and analysis of single item multi-period procurement lot-sizing problem considering rejections and late deliveries

Computers and Industrial Engineering
Multi-product economic lot scheduling problem with manufacturing and remanufacturing using a basic period policy

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Economic Lot Scheduling Problem (ELSP) has been well-researched for more than 40 years. As the ELSP has been generally seen as NP-hard, researchers have focused on the development of efficient heuristic approaches. In this paper, we consider the time-varying lot size approach to solve the ELSP. A computational study of the existing solution algorithms, Dobson's heuristic, Hybrid Genetic algorithm, Neighborhood Search heuristics, Tabu Search and the newly proposed Simulated Annealing algorithm are presented. The reviewed methods are first tested on two well-known problems, those of Bomberger's [Bomberger, E. E. (1966). A dynamic programming approach to a lot size scheduling problem. Management Science 12, 778-784] and Mallya's [Mallya, R (1992). Multi-product scheduling on a single machine: A case study. OMEGA: International Journal of Management Science 20, 529-534] problems. We show the Simulated Annealing algorithm finds the best known solution to these problems. A similar comparison study is performed on various problem sets previously suggested in the literature. The results show that the Simulated Annealing algorithm outperforms Dobson's heuristic, Hybrid Genetic algorithm and Neighborhood search heuristics on these problem sets. The Simulated Annealing algorithm also shows faster convergence than the best known Tabu Search algorithm, yet results in solutions of a similar quality. Finally, we report the results of the design of experiment study which compares the robustness of the mentioned meta-heuristic techniques.