A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems

Mohammed Berrada and Kathryn E. Stecke
Additional contact information
Mohammed Berrada: Département d'Études et de Recherches en Automatique, Centre d'Études et de Recherches de Toulouse, 31055 Toulouse Cedex, France
Kathryn E. Stecke: Graduate School of Business Administration, The University of Michigan, Ann Arbor, Michigan 48109-1234

Management Science, 1986, vol. 32, issue 10, 1316-1335

Abstract: A flexible manufacturing system (FMS) is an integrated system of computer numerically controlled machine tools connected with automated material handling. A set of production planning problems for FMSs has been defined (Stecke [Stecke, Kathryn E. 1983. Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems. Management Sci. 29 (3, March) 273--288.]), and this paper considers one called the loading problem. This problem involves assigning to the machine tools, operations and associated cutting tools required for part types that have been selected to be produced simultaneously. The part types will be machined during the upcoming production period (say, of one to three weeks duration on average) and according to a prespecified part mix. This assignment is constrained by the capacity of each machine's tool magazine as well as by the production capacities of both the system, and each machine type. There are several loading objectives that are applicable in a flexible manufacturing situation. This paper considers the most commonly applied one, that of balancing the workload on all machines. This paper first discusses a nonlinear integer mathematical programming formulation of the loading problem. The problem is formulated in all detail. Then an efficient solution procedure is proposed and illustrated with an example. Computational results are provided to demonstrate the efficiency of the suggested special-purpose procedures.

Keywords: production/scheduling: flexible manufacturing; production/scheduling: line balancing; programming: integer; algorithms: branch and bound (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.32.10.1316 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:32:y:1986:i:10:p:1316-1335

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().