Minimizing WIP inventory in reliable production lines

Papadopoulos, Chrissoleon T.; Vidalis, Michael

doi:10.1016/s0925-5273(00)00056-6

Cited by 42 publications

(20 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…, L max and i ≥ 1. Finally, part (i) of Lemma 1 and equations (25) and (29) give inequality (34), since u j, = u (K ,M) j, for j = M + 1, . .…”

Section: Proof Of Propositionmentioning

confidence: 95%

“…Moreover, pooling several stations at the end of the line usually yields a better WIP when systems with the same number of stations after pooling are compared. We believe that this is due to the facts that in such cases, the jobs are pushed out of the system more effectively and the added buffers are closer to the end of the line (see So [29] and Papadopoulos and Vidalis [25]). …”

Section: Pooling In Balanced Linesmentioning

confidence: 99%

See 1 more Smart Citation

Partial Pooling in Tandem Lines with Cooperation and Blocking

Argon

Andradóttir

2006

Queueing Syst

View full text Add to dashboard Cite

For a tandem line of finite, single-server queues operating under the production blocking mechanism, we study the effects of pooling several adjacent stations and the associated servers into a single station with a single team of servers. We assume that the servers are cross-trained (so that they can work at several different stations) and that two or more servers can cooperate on the same job. For such a system, we provide sufficient conditions on the service times and sizes of the input and output buffers at the pooled station under which pooling will decrease the departure time of each job from the system (and hence increase the system throughput). We also show that pooling decreases the total number of jobs in the system at any given time and the sojourn time of each job in the system if the departure time of each job from the system is decreased by pooling and there is an arrival stream at the first station. Moreover, we provide sufficient conditions under which pooling will improve the holding cost of each job in the system incurred before any given time, and extend our results to closed tandem lines and to queueing networks with either a more general blocking mechanism or probabilistic routing. Finally, we present a numerical study aimed at quantifying the improvements in system performance obtained through pooling and at understanding which stations should be pooled to achieve the maximum benefit. Our results suggest that the improvements gained by pooling may be substantial and that the bottleneck

show abstract

“…, L max and i ≥ 1. Finally, part (i) of Lemma 1 and equations (25) and (29) give inequality (34), since u j, = u (K ,M) j, for j = M + 1, . .…”

Section: Proof Of Propositionmentioning

confidence: 95%

Section: Pooling In Balanced Linesmentioning

confidence: 99%

Partial Pooling in Tandem Lines with Cooperation and Blocking

Argon

Andradóttir

2006

Queueing Syst

View full text Add to dashboard Cite

show abstract

“…WIP is defined as the amount of work left in the semi finished product. We have studied how WWAL incorporates better worker utilization and reduction of WIP [4]. In this paper, we are going to focus on optimization of manual mechanical assembling.…”

Section: Introductionmentioning

confidence: 99%

A case study on implementation of walking worker assembly line to improve productivity and utilisation of resources in a heavy duty manufacturing industry

Deepak¹,

Srivatsan²,

Samsingh³

2017

FME Transaction

View full text Add to dashboard Cite

“…Genetic algorithms belong for example to metaheuristics which can be applied to solve buffers sizing problems (Dolgui et al, 2002), (Hamada et al, 2006). Simulated Annealing is another method applied in many works (Spinellis et al, 2000), (Papadopoulos & Vidalis, 2001). The literature presents also other methods such as neural networks (Altiparmak et al, 2002) or Tabu search (Lutz et al, 1998).…”

Section: Introductionmentioning

confidence: 99%