Shortest-route formulation of mixed-model assembly line balancing problem.

*(English)*Zbl 1009.90120Summary: A shortest-route formulation of the mixed-model assembly line balancing problem is presented. Common tasks across models are assumed to exist and these tasks are performed in the same stations. The formulation is based on an algorithm which solves the single-model version of the problem. The mixed-model system is transformed into a single-model system with a combined precedence diagram. The model is capable of considering any constraint that can be expressed as a function of task assignments.

##### MSC:

90C35 | Programming involving graphs or networks |

90B80 | Discrete location and assignment |

90B10 | Deterministic network models in operations research |

PDF
BibTeX
XML
Cite

\textit{E. Erel} and \textit{H. Gokcen}, Eur. J. Oper. Res. 116, No. 1, 194--204 (1999; Zbl 1009.90120)

Full Text:
DOI

##### References:

[1] | Baybars, I., A survey of exact algorithms for the simple assembly line balancing problem, Management science, 32, 909-932, (1986) · Zbl 0601.90081 |

[2] | Chakravarty, A.K.; Shtub, A., Balancing mixed model lines with in-process inventories, Management science, 31, 1161-1174, (1985) · Zbl 0609.90057 |

[3] | Ghosh, S.; Gagnon, J., A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems, International journal of production research, 27, 637-670, (1989) |

[4] | Gutjahr, A.L.; Nemhauser, G.L., An algorithm for the line balancing problem, Management science, 11, 308-315, (1964) · Zbl 0137.39303 |

[5] | Klein, M., On assembly line balancing, Operations research, 11, 274-281, (1963) |

[6] | Mansoor, E.M., Improvement on the gutjahr and nemhauser algorithm for line balancing problems, Management science, 14, 250-254, (1967) |

[7] | Roberts, S.D.; Villa, C.D., On a multiproduct assembly line balancing problem, AIIE transactions, 2, 361-364, (1970) |

[8] | Salveson, M.E., The assembly line balancing problem, Journal of industrial engineering, 6, 18-25, (1955) |

[9] | Schrage, L.; Baker, K.R., Dynamic programming solution of sequencing problems with precedence constraints, Operations research, 26, 444-449, (1978) · Zbl 0383.90054 |

[10] | Sidney, J.B.; Steiner, G., Optimal sequencing by modular decomposition: polynomial algorithms, Operations research, 34, 606-612, (1986) · Zbl 0609.90068 |

[11] | Sparling, D.; Miltenburg, J., The mixed-model U-line balancing problem, International journal of production research, 36, 485-502, (1998) · Zbl 0951.90527 |

[12] | Thomopoulos, N.T., Mixed model line balancing with smoothed station assignments, Management science, 16, 593-603, (1970) · Zbl 0194.19801 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.