Sequencing mixed-model assembly lines to level parts usage and minimize line length

J. F. Bard, A. Shtub, Sanjay B. Joshi

Research output: Contribution to journalArticle

99 Citations (Scopus)

Abstract

The problem of sequencing units on a mixed-model assembly line can be viewed with several objectives in mind. Past research has focused mainly on two separate performance measures: (1) minimizing the length of the line (which is equivalent to minimizing the risk of stopping the conveyor when system variability is present and the station lengths are fixed); or (2) maintaining a rate of assembly equal to the demand rate for each model type in the production schedule. The latter is the more appropriate in a just-in-time environment. We present a bicriteria formulation of the problem that can be used to examine the tradeoffs between line length and parts usage. The resultant model takes the form of a mixed integer nonlinear program and is solved with a combination of heuristics and branch and bound. Results are reported for a wide range of problem sizes, as defined by the number of stations on the line, the number of different model types, and the total number of units to be assembled. In almost all cases, at least one of the heuristics found either the optimum or the best available solution. Computation times were quite reasonable for the heuristics, but grew exponentially for branch and bound. In general, it was only possible to verify optimality on problems with ⩽20 units.

Original languageEnglish (US)
Pages (from-to)2431-2454
Number of pages24
JournalInternational Journal of Production Research
Volume32
Issue number10
DOIs
StatePublished - Jan 1 1994

Fingerprint

Mixed-model assembly line
Heuristics
Sequencing
Branch-and-bound
Integer
Just-in-time
Trade-offs
Schedule
Bicriteria
Performance measures
Optimality

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{8b3a53f11ff94d10989ed80441b30136,
title = "Sequencing mixed-model assembly lines to level parts usage and minimize line length",
abstract = "The problem of sequencing units on a mixed-model assembly line can be viewed with several objectives in mind. Past research has focused mainly on two separate performance measures: (1) minimizing the length of the line (which is equivalent to minimizing the risk of stopping the conveyor when system variability is present and the station lengths are fixed); or (2) maintaining a rate of assembly equal to the demand rate for each model type in the production schedule. The latter is the more appropriate in a just-in-time environment. We present a bicriteria formulation of the problem that can be used to examine the tradeoffs between line length and parts usage. The resultant model takes the form of a mixed integer nonlinear program and is solved with a combination of heuristics and branch and bound. Results are reported for a wide range of problem sizes, as defined by the number of stations on the line, the number of different model types, and the total number of units to be assembled. In almost all cases, at least one of the heuristics found either the optimum or the best available solution. Computation times were quite reasonable for the heuristics, but grew exponentially for branch and bound. In general, it was only possible to verify optimality on problems with ⩽20 units.",
author = "Bard, {J. F.} and A. Shtub and Joshi, {Sanjay B.}",
year = "1994",
month = "1",
day = "1",
doi = "10.1080/00207549408957076",
language = "English (US)",
volume = "32",
pages = "2431--2454",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "10",

}

Sequencing mixed-model assembly lines to level parts usage and minimize line length. / Bard, J. F.; Shtub, A.; Joshi, Sanjay B.

In: International Journal of Production Research, Vol. 32, No. 10, 01.01.1994, p. 2431-2454.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Sequencing mixed-model assembly lines to level parts usage and minimize line length

AU - Bard, J. F.

AU - Shtub, A.

AU - Joshi, Sanjay B.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - The problem of sequencing units on a mixed-model assembly line can be viewed with several objectives in mind. Past research has focused mainly on two separate performance measures: (1) minimizing the length of the line (which is equivalent to minimizing the risk of stopping the conveyor when system variability is present and the station lengths are fixed); or (2) maintaining a rate of assembly equal to the demand rate for each model type in the production schedule. The latter is the more appropriate in a just-in-time environment. We present a bicriteria formulation of the problem that can be used to examine the tradeoffs between line length and parts usage. The resultant model takes the form of a mixed integer nonlinear program and is solved with a combination of heuristics and branch and bound. Results are reported for a wide range of problem sizes, as defined by the number of stations on the line, the number of different model types, and the total number of units to be assembled. In almost all cases, at least one of the heuristics found either the optimum or the best available solution. Computation times were quite reasonable for the heuristics, but grew exponentially for branch and bound. In general, it was only possible to verify optimality on problems with ⩽20 units.

AB - The problem of sequencing units on a mixed-model assembly line can be viewed with several objectives in mind. Past research has focused mainly on two separate performance measures: (1) minimizing the length of the line (which is equivalent to minimizing the risk of stopping the conveyor when system variability is present and the station lengths are fixed); or (2) maintaining a rate of assembly equal to the demand rate for each model type in the production schedule. The latter is the more appropriate in a just-in-time environment. We present a bicriteria formulation of the problem that can be used to examine the tradeoffs between line length and parts usage. The resultant model takes the form of a mixed integer nonlinear program and is solved with a combination of heuristics and branch and bound. Results are reported for a wide range of problem sizes, as defined by the number of stations on the line, the number of different model types, and the total number of units to be assembled. In almost all cases, at least one of the heuristics found either the optimum or the best available solution. Computation times were quite reasonable for the heuristics, but grew exponentially for branch and bound. In general, it was only possible to verify optimality on problems with ⩽20 units.

UR - http://www.scopus.com/inward/record.url?scp=0000363908&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000363908&partnerID=8YFLogxK

U2 - 10.1080/00207549408957076

DO - 10.1080/00207549408957076

M3 - Article

VL - 32

SP - 2431

EP - 2454

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 10

ER -