2007
DOI: 10.1080/07408170600838423
|View full text |Cite
|
Sign up to set email alerts
|

Approximate analysis of serial flow lines with multiple parallel-machine stations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0
2

Year Published

2008
2008
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(14 citation statements)
references
References 26 publications
0
12
0
2
Order By: Relevance
“…A more extensive comparison of these algorithms is presented in Tsadiras, Papadopoulos, and O'Kelly (2012) leading to the same conclusions. Based on these results, the Myopic algorithm was chosen to be used for the experiments of this study in conjunction with the decomposition algorithm developed by Diamantidis, Papadopoulos, and Heavey (2006), since the large number of experiments makes the speed of the algorithm an important decision criterion. All the experiments were run on an available desktop PC with the following specifications: Windows XP Professional Version 2002 Service Pack 3, Intel Core 2 Duo CPU E8400@3.00 GHz, 2.00 GB RAM.…”
Section: Design Of the Production Line Experiments To Collect Traininmentioning
confidence: 99%
“…A more extensive comparison of these algorithms is presented in Tsadiras, Papadopoulos, and O'Kelly (2012) leading to the same conclusions. Based on these results, the Myopic algorithm was chosen to be used for the experiments of this study in conjunction with the decomposition algorithm developed by Diamantidis, Papadopoulos, and Heavey (2006), since the large number of experiments makes the speed of the algorithm an important decision criterion. All the experiments were run on an available desktop PC with the following specifications: Windows XP Professional Version 2002 Service Pack 3, Intel Core 2 Duo CPU E8400@3.00 GHz, 2.00 GB RAM.…”
Section: Design Of the Production Line Experiments To Collect Traininmentioning
confidence: 99%
“…In order to improve production rate and/or reliability, a workstation has multiple machines in parallel [3]. Approximate solutions for the reliable lines with multiple machines using decomposition method are presented by [4,15,16]. The literature on the analysis of the unreliable systems with multiple machines in a workstation and finite buffer is more scarce than the reliable system.…”
Section: Yang Woo Shin and Dug Hee Moonmentioning
confidence: 99%
“…The Buffers are defined by their size. If there is one upstream product, the layout of the line is always the same: Machine; Buffer; Machine; Buffer; Machine … It is assumed, that the first machine is never starved and the last machine is never blocked and machine failures are exponentially distributed [10,11]. A stochastic process is a random variable indexed by a parameter; we denote it by X(t).…”
Section: The Modelling Methodology For a Flow Linementioning
confidence: 99%