Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
J Heuristics (2006) 12:413426 DOI 10.1007/s10732-006-6017-7
 

Summary: J Heuristics (2006) 12:413­426
DOI 10.1007/s10732-006-6017-7
A tabu search algorithm for solving economic lot
scheduling problem
S. A. Raza · A. Akgunduz · M. Y. Chen
Submitted in April 2005 and accepted by Rafael Mart´i in November 2005 after 1 revision
C Springer Science + Business Media, LLC 2006
Abstract The economic lot scheduling problem has driven considerable amount of research.
The problem is NP-hard and recent research is focused on finding heuristic solutions rather
than searching for optimal solutions. This paper introduces a heuristic method using a tabu
search algorithm to solve the economic lot scheduling problem. Diversification and intensifi-
cation schemes are employed to improve the efficiency of the proposed Tabu search algorithm.
Experimental design is conducted to determine the best operating parameters for the Tabu
search. Results show that the tabu search algorithm proposed in this paper outperforms two
well known benchmark algorithms.
Keywords Economic lot scheduling problem . Tabu search . Neighborhood search and
design of experiment
1 Introduction
The Economic Lot Scheduling Problem (ELSP) deals with the production assignment of
severalproductssharingthesameproductionfacility.TheobjectiveoftheELSPistominimize

  

Source: Akgunduz, Ali - Department of Mechanical and Industrial Engineering, Concordia University

 

Collections: Engineering