Designing paced assembly lines with fixed number of stations
✍ Scribed by H. Fatih Uğurdağ; Ram Rachamadugu; Christos A. Papachristou
- Book ID
- 104339392
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 999 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
✦ Synopsis
This paper addresses the issue of allocating tasks among workstations in assembly lines so that the cycle time is minimized (Type II problem). We provide a twostage heuristic procedure, which is based on an integer programming formulation of the problem. It is a simplexlike procedure which, while attempting to minimize the cycle time, also smooths out the workload among the workstations. Computational results show that our procedure performs well for Type II problems. Tests on problems from the literature indicate that the smoothing stage of our procedure can be used effectively to level workloads for any given task allocations among tasks.
📜 SIMILAR VOLUMES
## Abstract The following results for proper quasi‐symmetric designs with non‐zero intersection numbers __x__,__y__ and λ > 1 are proved. Let __D__ be a quasi‐symmetric design with __z__ = __y__ − __x__ and __v__ ≥ 2__k__. If __x__ ≥ 1 + __z__ + __z__^3^ then λ < __x__ + 1 + __z__ + __z__^3^. Let