OPTIMIZING TOTAL IDLE TIME IN A MIXED-MODEL ASSEMBLY LINE THROUGH WORKLOAD ADJUSTMENT
Keywords:
Allocation of Tasks, Line Optimization, Minimization, Models Load, NOS, Idle Time of Each Station, Iterations, Balancing Load, Minimize the Balance DelayAbstract
The fundamental of ALBP is to minimize and assign the number of workstations; minimize balance delay; and line balancing loss, idle time minimizing, minimizing CT. The purpose of the ALBP is to distribute the activities equally to the available workstations, this in turn increases the utilization of human resourced and the available facilities.
The MMuALB is used to optimize for the best performance to reduce the losses. Four models with different quantities of production are treated for assembly line optimization. The TNOS required for optimise allocation are considered. The algorithm was used to demonstrate 19 task problem which minimizes balancing and system loss. The quantities of models to be producedare10eachforallthe four models. The algorithm developed is based on branch and bound technique. Buxey 29 task based problem is considered for solution for least idle time of the work stations.
References
I. Salveson, M.E. (1955). The assembly line balancing problem. J. Ind. Engng., 6 (3), 18-25.
II. Gutjahr, A., Nemhauser, G., 1964. An algorithm for the line balancing problem. Management Science 11,308–315
III. Kilbridge, M.D. and L. Wester (1961). A heuristic method for assembly line balancing. Journal of Industrial Engineering, 12, 292-298.
IV. Helgeson, W. B. and D. P. Birnie (1961). Assembly line balancing using the ranked positional weight technique, J. Ind. Engng, 12 (6), 394-398.
V. Hoffmann, T. R., 1963. Assembly Line Balancing with a Precedence Matrix. Management Science. Vol. 9.
VI. Mansoor, E.M., 1964. Assembly Line Balancing -An Improvement on the Ranked Positional Weight.
VII. Arcus A.L., 1966. COMSOAL: A Computer Method of Sequencing Operations for Assembly Lines. International Journal of Production Research. Vol. 4, No.4: pp.259-277.
VIII. Baybars, I. (1986). A survey of exact algorithms for the simple assembly line balancing, management Science, 32, 909-932.
IX. Jackson, J.R. (1956). A computing procedure for the line balancing problem. Management Science, 2.
X. Bowman, E.H. (1960). Assembly line balancing by linear programming, Operations Research, 8 (3).
XI. Van Assche, F. and Herroelen, W. S., 1978. An Optimal Procedure for the Single-Model Deterministic.
XII. Mamoud, K. I., 1989. A Generalised Assembly Line Balancing Algorithm. PhD. Dissertation, University.
XIII. Sarin, S.C., E. Erel and E.M. Dar-El., 1999. A Methodology for Solving Single-Model, Stochastic Assembly.
XIV. Boysen, N., Fliedner, M., 2007.A versatile algorithm for assembly line balancing. European Journal of Operational.
XV. Scholl, A. and Klein, R., 1999. ULINO: Optimally balancing U-shaped JIT assembly lines. International Journal of Production Research. Vol. 37, No.4: pp.721-736.
XVI. Becker, C.; Scholl, A., (2006), A survey on problems and methods in generalized assembly line balancing. European Journal of Opera-tional Research, 168(3), 694-715.
XVII. Boctor, F., (1995), A multiple-rule heuristic for assembly line balancing. Journal of the Operational Research Society, 46, 62-69.
XVIII. Amen, M., (2001), Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time. International Journal of Production Economic.
XIX. Pinnoi, A.; Wilhelm, W. E., (1998), Assembly system design: A branch and cut approach. Management Science, 44, 103-118.
XX. Bukchin, Y.; Rabinowitch, I., (2006), A branch- and-bound based solution approach for the mixed-model assembly line-balancing problem form minimizing stations and task duplication costs. European Journal of Operational Research, 174, 492-508.
XXI. Peeters, A., (2006), Linear programming based lower bound for the simple assembly line balancing problem. European Journal of Operations Research, 168(3), 716-731.
XXII. Grabau, M. R.; Maurer, R. A.; Ott., D. P., (1997), Using simulation to generate the data to balance an assembly line. Proceeding of the 1997 Winter Simulation Conference, WSC, (Atlanta, GA, December 7-10), 733-738.
XXIII. McMullen, P. R.; Frazier, G. V., (1998), Using simulated annealing to solve a multi objective assembly line balancing problem with parallel workstations. International Journal of Production Research, 36(10), 2717-2741.
XXIV. Baybars, I. (1986). A survey of exact algorithms for the simple assembly line balancing, Management Science, 32, 909-932.
XXV. Ghosh S. and R. J. Gagnon., 1989. A Comprehensive Literature Review and Analysis of the Design, Balancing and Scheduling of Assembly Systems. International Journal of Production Research.
XXVI. Erel, E. and S.C. Sarin., 1998.A Survey ofthe Assembly Line Balancing Procedures. Production Planning.
XXVII. Scholl, A. 1993. Data of Assem line Balancing problems. Retrieved fromhttp://www.wiwi.uni-jena.de/Entscheidung/alb/.
Additional Files
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 International Educational Journal of Science and Engineering
This work is licensed under a Creative Commons Attribution 4.0 International License.
