Document Type

Article

Language

eng

Publication Date

12-1996

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Source Publication

IEEE Transactions on Robotics and Automation

Source ISSN

1042-296X

Original Item ID

DOI: 10.1109/70.544769

Abstract

Production planning in flexible manufacturing system deals with the efficient organization of the production resources in order to meet a given production schedule. It is a complex problem and typically leads to several hierarchical subproblems that need to be solved sequentially or simultaneously. Loading is one of the planning subproblems that has to addressed. It involves assigning the necessary operations and tools among the various machines in some optimal fashion to achieve the production of all selected part types. In this paper, we first formulate the loading problem as a 0-1 mixed integer program and then propose heuristic procedures based on Lagrangian relaxation and tabu search to solve the problem. Computational results are presented for all the algorithms and finally, conclusions drawn based on the results are discussed.

Comments

Published version. IEEE Transactions on Robotics and Automation, Volume 12, No. 6 (December 1996). DOI. ©1996 IEEE. Used with permission.

Download

Included in

Business Commons

Share

COinS