Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum

Seong in Kim, Junghee Han, Youngho Lee, Eunkyung Park

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost, and inventory cost. Incorporating the constraints of setup carry-over and overlapping as well as demand splitting, we develop a mixed integer programming (MIP) formulation. In the formulation, problem size does not increase as we enhance the precision level of a time period; for example, by dividing a time period into a number of microtime periods. Accordingly, in the proposed model, we treat the time horizon as a continuum not as a collection of discrete time periods. Since the problem is theoretically intractable, we develop a simple but efficient heuristic algorithm by devising a decomposition scheme coupled with a local search procedure. Even if in theory the heuristic may not guarantee finding a feasible solution, computational results demonstrate that the proposed algorithm is a viable choice in practice for finding good quality feasible solutions within acceptable time limit.

Original languageEnglish
Pages (from-to)302-314
Number of pages13
JournalComputers and Operations Research
Volume37
Issue number2
DOIs
Publication statusPublished - 2010 Feb 1

Fingerprint

Lot Sizing
Heuristic algorithms
Heuristic algorithm
Scheduling Problem
Horizon
Continuum
Scheduling
Decomposition
Decompose
Costs
Integer programming
Setup Cost
Formulation
Mixed Integer Programming
Local Search
Overlapping
Computational Results
Discrete-time
Efficient Algorithms
Heuristics

Keywords

  • Heuristic
  • Lot-sizing and scheduling
  • Production system

ASJC Scopus subject areas

  • Computer Science(all)
  • Management Science and Operations Research
  • Modelling and Simulation

Cite this

Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum. / Kim, Seong in; Han, Junghee; Lee, Youngho; Park, Eunkyung.

In: Computers and Operations Research, Vol. 37, No. 2, 01.02.2010, p. 302-314.

Research output: Contribution to journalArticle

@article{bb8d11ca30dd4a2ab9327a3d9b808517,
title = "Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum",
abstract = "In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost, and inventory cost. Incorporating the constraints of setup carry-over and overlapping as well as demand splitting, we develop a mixed integer programming (MIP) formulation. In the formulation, problem size does not increase as we enhance the precision level of a time period; for example, by dividing a time period into a number of microtime periods. Accordingly, in the proposed model, we treat the time horizon as a continuum not as a collection of discrete time periods. Since the problem is theoretically intractable, we develop a simple but efficient heuristic algorithm by devising a decomposition scheme coupled with a local search procedure. Even if in theory the heuristic may not guarantee finding a feasible solution, computational results demonstrate that the proposed algorithm is a viable choice in practice for finding good quality feasible solutions within acceptable time limit.",
keywords = "Heuristic, Lot-sizing and scheduling, Production system",
author = "Kim, {Seong in} and Junghee Han and Youngho Lee and Eunkyung Park",
year = "2010",
month = "2",
day = "1",
doi = "10.1016/j.cor.2009.05.007",
language = "English",
volume = "37",
pages = "302--314",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "2",

}

TY - JOUR

T1 - Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum

AU - Kim, Seong in

AU - Han, Junghee

AU - Lee, Youngho

AU - Park, Eunkyung

PY - 2010/2/1

Y1 - 2010/2/1

N2 - In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost, and inventory cost. Incorporating the constraints of setup carry-over and overlapping as well as demand splitting, we develop a mixed integer programming (MIP) formulation. In the formulation, problem size does not increase as we enhance the precision level of a time period; for example, by dividing a time period into a number of microtime periods. Accordingly, in the proposed model, we treat the time horizon as a continuum not as a collection of discrete time periods. Since the problem is theoretically intractable, we develop a simple but efficient heuristic algorithm by devising a decomposition scheme coupled with a local search procedure. Even if in theory the heuristic may not guarantee finding a feasible solution, computational results demonstrate that the proposed algorithm is a viable choice in practice for finding good quality feasible solutions within acceptable time limit.

AB - In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost, and inventory cost. Incorporating the constraints of setup carry-over and overlapping as well as demand splitting, we develop a mixed integer programming (MIP) formulation. In the formulation, problem size does not increase as we enhance the precision level of a time period; for example, by dividing a time period into a number of microtime periods. Accordingly, in the proposed model, we treat the time horizon as a continuum not as a collection of discrete time periods. Since the problem is theoretically intractable, we develop a simple but efficient heuristic algorithm by devising a decomposition scheme coupled with a local search procedure. Even if in theory the heuristic may not guarantee finding a feasible solution, computational results demonstrate that the proposed algorithm is a viable choice in practice for finding good quality feasible solutions within acceptable time limit.

KW - Heuristic

KW - Lot-sizing and scheduling

KW - Production system

UR - http://www.scopus.com/inward/record.url?scp=69549124012&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69549124012&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2009.05.007

DO - 10.1016/j.cor.2009.05.007

M3 - Article

VL - 37

SP - 302

EP - 314

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 2

ER -