Incorporating a database approach into the large-scale multi-level lot sizing problem

Authors:
Dong-Shang Chang;Fu-Chiao Chyr;Fu-Chiang Yang
Affiliations:
Department of Business Administration, National Central University, Taiwan, ROC;Department of International Business, Chang Jung Christian University, Taiwan, ROC;Department of Business Administration, National Central University, Taiwan, ROC
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 5
Cited 1

Optimal lot-sizing algorithms for complex product structures

Operations Research
From EOQ towards ZI

Management Science
Improved heuristic methods for multiple stage production planning

Computers and Operations Research
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems

Computers and Operations Research
Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight

Computers & Mathematics with Applications

An innovative method for data and software integration in SaaS

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.09

Visualization

Abstract

Traditionally, optimization for large-scale multi-level lot sizing (MLLS) problems always encountered heavy computational burden. Scholars also indicated that ''whatever the optimal method chosen to solve the MLLS problem, standard optimization packages were still faced with computer memory constraints and computational limits that prevented them from solving realistic size cases''. Therefore, the main purpose of this paper is to propose an optimal method to reduce the computer memory while solving the large-scale MLLS problems. The optimal method is designed to implement on a database entirely because the demand for computer memory can be reduced significantly by means of the utilization of database storage. An example is given to illustrate the proposed method and computation capability is tested for the MLLS problems with up to 1000 levels and 12 periods.