1991
DOI: 10.1287/mnsc.37.7.901
|View full text |Cite
|
Sign up to set email alerts
|

Note—Sequencing JIT Mixed-Model Assembly Lines

Abstract: We provide a new formulation and solution procedure to sequence a mixed model just-in-time (JIT) assembly system. Mixed model JIT assembly systems are a fundamental part of the well-known “Toyota Production System.” The underlying idea in sequencing these systems is to maintain a constant usage rate of all parts on the line. We give a polynomial algorithm to determine the optimal sequence for an objective function that is mathematically different, but intuitively similar to the objective functions of previous … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
31
0

Year Published

1993
1993
2017
2017

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 113 publications
(31 citation statements)
references
References 3 publications
0
31
0
Order By: Relevance
“…It is the idea of producing exactly what the customer wants, in the quantities they want, where they want it, when the customer wants it without being delayed or held upon inventory [28]. Inman and Bulfin [29] implied that JIT implementation provokes to reduce hurdles like long change over time; unleveled production schedules; highly variable production processes; large container sizes; severe bottlenecks and long lead time.…”
Section: Just In Time (Jit)mentioning
confidence: 99%
“…It is the idea of producing exactly what the customer wants, in the quantities they want, where they want it, when the customer wants it without being delayed or held upon inventory [28]. Inman and Bulfin [29] implied that JIT implementation provokes to reduce hurdles like long change over time; unleveled production schedules; highly variable production processes; large container sizes; severe bottlenecks and long lead time.…”
Section: Just In Time (Jit)mentioning
confidence: 99%
“…Miltenburg (1989) solved the same problem with a dynamic programming algorithm. Inman and Bulfin (1991) solved the problem proposed by Miltenburg and Sinnamon (1989) by converting it to a mathematically different approach. Other objectives have also been considered by a number of researchers.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Assuming that all models require (almost) the same number and mix of parts (Miltenburg, 1989), it is sucient to level the model occurrences over time (e.g. Kubiak and Sethi, 1991;Inman and Buln, 1991;Steiner and Yeomans, 1993). Literature reviews are provided by Kubiak (1993), Dhamala and Kubiak (2005) as well as Boysen et al (2006).…”
Section: Literature Reviewmentioning
confidence: 99%