Home|News|Literature|Journal|Instruction|Forum|Member|Introduction

Chinese  Old version

By    In    Search 

  HomeContents of Chinese Journal of Mechanical Engineering (English Edition),2003 No.1CAPACITATED LOT SIZING AND SCHEDULING PROBLEMS USING HYBRID GA/TS APPROACHES

Yang Honghong

 

Wu Zhiming

Department of Automation,
Shanghai Jiaotong University,
Shanghai 200030, China

 

 

CAPACITATED LOT SIZING AND
SCHEDULING PROBLEMS USING
HYBRID GA/TS APPROACHES*


Abstract: The capacitated lot sizing and scheduling problem that involves in determining the production amounts and release dates for several items over a given planning horizon are given to meet dynamic order demand without incurring backloggings. The problem considering overtime capacity is studied. The mathematical model is presented, and a genetic algorithm (GA) approach is developed to solve the problem. The initial solutions are generated after using heuristic method. Capacity balancing procedure is employed to stipulate the feasibility of the solutions. In addition, a technique based on Tabu search (TS) is inserted into the genetic algorithm to deal with the scheduled overtime and help the convergence of algorithm. Computational simulation is conducted to test the efficiency of the proposed hybrid approach, which turns out to improve both the solution quality and execution speed.

Key words: Production planning  Capacitated lot sizing  Genetic algorithm  Tabu search 
                    Capacity balancing

 


* This project is supported by National Natural Science Foundation of China (No.70071017, No.60074011) and the Open-lab of Manufacturing System Engineering, Xi’an Jiaotong University, China. Received July 12, 2001; received in revised form December 8, 2001; accepted September 5, 2002

 

Open or Download Full Text of this Paper (PDF File)

About us-Contact us-Site map-Advertisement service-Cooperation-Legal statement

Address: 22 Baiwanzhuang Dajie, Beijing 100037 China    Tel: 8610-88379907    Fax: 8610-68994557

E-mail: cjme@mail.machineinfo.gov.cn  http: //www.cjmenet.com
©2006 Editorial Office of CJME. All Right Reserved