Recent research trend of economic-lot scheduling problems

Hing Kai Chan, Sai Ho Chung, Ming K. Lim

Research output: Journal article publicationJournal articleAcademic researchpeer-review

22 Citations (Scopus)

Abstract

Purpose - This research note aims to present a summary of research concerning economic-lot scheduling problem (ELSP). Design/methodology/approach - The paper's approach is to review over 100 selected studies published in the last 15 years (1997-2012), which are then grouped under different research themes. Findings - Five research themes are identified and insights for future studies are reported at the end of this paper. Research limitations/implications - The motivation of preparing this research note is to summarize key research studies in this field since 1997, when the ELSP problems have been verified as NP-hard. Originality/value - ELSP is an important scheduling problem that has been studied since the 1950s. Because of its complexity in delivering a feasible analytical closed form solution, many studies in the last two decades employed heuristic algorithms in order to come up with good and acceptable solutions. As a consequence, the solution approaches are quite diversified. The major contribution of this paper is to provide researchers who are interested in this area with a quick reference guide on the reviewed studies.
Original languageEnglish
Pages (from-to)465-482
Number of pages18
JournalJournal of Manufacturing Technology Management
Volume24
Issue number3
DOIs
Publication statusPublished - 11 Jun 2013

Keywords

  • Economic-lot scheduling problem
  • Lot-sizing
  • Operations management
  • Production scheduling
  • Review
  • Scheduling

ASJC Scopus subject areas

  • Computer Science Applications
  • Software
  • Industrial and Manufacturing Engineering
  • Control and Systems Engineering
  • Strategy and Management

Cite this