𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A part-machine assignment algorithm for cellular manufacturing with machine capacity constraints

✍ Scribed by Soha Eid Moussa; Mohamed Kamel

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
275 KB
Volume
35
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

✦ Synopsis

Many researchers have attempted to solve the cellular manufacturing problem using various clustering techniques; however, few have considered the effect of production constraints. In this paper an algorithm for the assignment of parts to machines to solve the group technology problem which takes into consideration the effect of machine capacity constraints is discussed. The effect of this constraint is demonstrated by an example.

πŸ“œ SIMILAR VOLUMES

A linear assignment algorithm for format
A linear assignment algorithm for formation of machine cells and part families in cellular manufacturing
✍ Jun Wang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 224 KB

This paper presents a linear assignment algorithm for machine-cell and part-family formation to design cellular manufacturing systems. The present approach begins with the determination of part-family or machine-cell representatives by means of comparing similarity coefficients between parts or mach

An approximation algorithm for schedulin
An approximation algorithm for scheduling two parallel machines with capacity constraints
✍ Heng Yang; Yinyu Ye; Jiawei Zhang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 205 KB

We consider the problem of scheduling n independent jobs on two identical parallel machines, with a limit on the number of jobs that can be assigned to each single machine, so as to minimize the total weighted completion time of the jobs. We study a semideΓΏnite programming-based approximation algori