System performance analysis of flexible flow shop with match processing constraint

Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Zhang, Hui-Yu [verfasserIn] Chen, Qing-Xin Mao, Ning

Format:	Artikel
Sprache:	Englisch

Erschienen:	2016

Rechteinformationen:	Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016

Schlagwörter:	performance analysis queuing networks match processing constraint finite buffers Performance evaluation Queuing theory Markov analysis Methods

Übergeordnetes Werk:	Enthalten in: International journal of production research - London : Taylor & Francis, 1961, 54(2016), 20, Seite 6052-6070
Übergeordnetes Werk:	volume:54 ; year:2016 ; number:20 ; pages:6052-6070

Links:	Volltext Link aufrufen Link aufrufen

DOI / URN:	10.1080/00207543.2016.1166286

Katalog-ID:	OLC1981318143

Internformat


LEADER	01000caa a2200265 4500
001	OLC1981318143
003	DE-627
005	20220221044806.0
007	tu
008	161013s2016 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1080/00207543.2016.1166286 \|2 doi
028	5	2	\|a PQ20161012
035			\|a (DE-627)OLC1981318143
035			\|a (DE-599)GBVOLC1981318143
035			\|a (PRQ)c1545-c129bf0669ec545bfddf48b8bdd089f4dce8b6c37d7621e1a7ee519955520790
035			\|a (KEY)0019873020160000054002006052systemperformanceanalysisofflexibleflowshopwithmat
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 600 \|a 620 \|a 330 \|q DNB
084			\|a 85.35 \|2 bkl
084			\|a 52.70 \|2 bkl
100	1		\|a Zhang, Hui-Yu \|e verfasserin \|4 aut
245	1	0	\|a System performance analysis of flexible flow shop with match processing constraint
264		1	\|c 2016
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
520			\|a Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems.
540			\|a Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016
650		4	\|a performance analysis
650		4	\|a queuing networks
650		4	\|a match processing constraint
650		4	\|a finite buffers
650		4	\|a Performance evaluation
650		4	\|a Queuing theory
650		4	\|a Markov analysis
650		4	\|a Methods
700	1		\|a Chen, Qing-Xin \|4 oth
700	1		\|a Mao, Ning \|4 oth
773	0	8	\|i Enthalten in \|t International journal of production research \|d London : Taylor & Francis, 1961 \|g 54(2016), 20, Seite 6052-6070 \|w (DE-627)129358835 \|w (DE-600)160477-6 \|w (DE-576)014731150 \|x 0020-7543 \|7 nnns
773	1	8	\|g volume:54 \|g year:2016 \|g number:20 \|g pages:6052-6070
856	4	1	\|u http://dx.doi.org/10.1080/00207543.2016.1166286 \|3 Volltext
856	4	2	\|u http://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1166286
856	4	2	\|u http://search.proquest.com/docview/1818405612
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-TEC
912			\|a SSG-OLC-WIW
912			\|a GBV_ILN_21
912			\|a GBV_ILN_26
912			\|a GBV_ILN_70
912			\|a GBV_ILN_4126
936	b	k	\|a 85.35 \|q AVZ
936	b	k	\|a 52.70 \|q AVZ
951			\|a AR
952			\|d 54 \|j 2016 \|e 20 \|h 6052-6070

Indexfelder

author_variant	h y z hyz
matchkey_str	article:00207543:2016----::ytmefracaayiofeilfosowtmthr
hierarchy_sort_str	2016
bklnumber	85.35 52.70
publishDate	2016
allfields	10.1080/00207543.2016.1166286 doi PQ20161012 (DE-627)OLC1981318143 (DE-599)GBVOLC1981318143 (PRQ)c1545-c129bf0669ec545bfddf48b8bdd089f4dce8b6c37d7621e1a7ee519955520790 (KEY)0019873020160000054002006052systemperformanceanalysisofflexibleflowshopwithmat DE-627 ger DE-627 rakwb eng 600 620 330 DNB 85.35 bkl 52.70 bkl Zhang, Hui-Yu verfasserin aut System performance analysis of flexible flow shop with match processing constraint 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 performance analysis queuing networks match processing constraint finite buffers Performance evaluation Queuing theory Markov analysis Methods Chen, Qing-Xin oth Mao, Ning oth Enthalten in International journal of production research London : Taylor & Francis, 1961 54(2016), 20, Seite 6052-6070 (DE-627)129358835 (DE-600)160477-6 (DE-576)014731150 0020-7543 nnns volume:54 year:2016 number:20 pages:6052-6070 http://dx.doi.org/10.1080/00207543.2016.1166286 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1166286 http://search.proquest.com/docview/1818405612 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-WIW GBV_ILN_21 GBV_ILN_26 GBV_ILN_70 GBV_ILN_4126 85.35 AVZ 52.70 AVZ AR 54 2016 20 6052-6070
spelling	10.1080/00207543.2016.1166286 doi PQ20161012 (DE-627)OLC1981318143 (DE-599)GBVOLC1981318143 (PRQ)c1545-c129bf0669ec545bfddf48b8bdd089f4dce8b6c37d7621e1a7ee519955520790 (KEY)0019873020160000054002006052systemperformanceanalysisofflexibleflowshopwithmat DE-627 ger DE-627 rakwb eng 600 620 330 DNB 85.35 bkl 52.70 bkl Zhang, Hui-Yu verfasserin aut System performance analysis of flexible flow shop with match processing constraint 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 performance analysis queuing networks match processing constraint finite buffers Performance evaluation Queuing theory Markov analysis Methods Chen, Qing-Xin oth Mao, Ning oth Enthalten in International journal of production research London : Taylor & Francis, 1961 54(2016), 20, Seite 6052-6070 (DE-627)129358835 (DE-600)160477-6 (DE-576)014731150 0020-7543 nnns volume:54 year:2016 number:20 pages:6052-6070 http://dx.doi.org/10.1080/00207543.2016.1166286 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1166286 http://search.proquest.com/docview/1818405612 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-WIW GBV_ILN_21 GBV_ILN_26 GBV_ILN_70 GBV_ILN_4126 85.35 AVZ 52.70 AVZ AR 54 2016 20 6052-6070
allfields_unstemmed	10.1080/00207543.2016.1166286 doi PQ20161012 (DE-627)OLC1981318143 (DE-599)GBVOLC1981318143 (PRQ)c1545-c129bf0669ec545bfddf48b8bdd089f4dce8b6c37d7621e1a7ee519955520790 (KEY)0019873020160000054002006052systemperformanceanalysisofflexibleflowshopwithmat DE-627 ger DE-627 rakwb eng 600 620 330 DNB 85.35 bkl 52.70 bkl Zhang, Hui-Yu verfasserin aut System performance analysis of flexible flow shop with match processing constraint 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 performance analysis queuing networks match processing constraint finite buffers Performance evaluation Queuing theory Markov analysis Methods Chen, Qing-Xin oth Mao, Ning oth Enthalten in International journal of production research London : Taylor & Francis, 1961 54(2016), 20, Seite 6052-6070 (DE-627)129358835 (DE-600)160477-6 (DE-576)014731150 0020-7543 nnns volume:54 year:2016 number:20 pages:6052-6070 http://dx.doi.org/10.1080/00207543.2016.1166286 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1166286 http://search.proquest.com/docview/1818405612 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-WIW GBV_ILN_21 GBV_ILN_26 GBV_ILN_70 GBV_ILN_4126 85.35 AVZ 52.70 AVZ AR 54 2016 20 6052-6070
allfieldsGer	10.1080/00207543.2016.1166286 doi PQ20161012 (DE-627)OLC1981318143 (DE-599)GBVOLC1981318143 (PRQ)c1545-c129bf0669ec545bfddf48b8bdd089f4dce8b6c37d7621e1a7ee519955520790 (KEY)0019873020160000054002006052systemperformanceanalysisofflexibleflowshopwithmat DE-627 ger DE-627 rakwb eng 600 620 330 DNB 85.35 bkl 52.70 bkl Zhang, Hui-Yu verfasserin aut System performance analysis of flexible flow shop with match processing constraint 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 performance analysis queuing networks match processing constraint finite buffers Performance evaluation Queuing theory Markov analysis Methods Chen, Qing-Xin oth Mao, Ning oth Enthalten in International journal of production research London : Taylor & Francis, 1961 54(2016), 20, Seite 6052-6070 (DE-627)129358835 (DE-600)160477-6 (DE-576)014731150 0020-7543 nnns volume:54 year:2016 number:20 pages:6052-6070 http://dx.doi.org/10.1080/00207543.2016.1166286 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1166286 http://search.proquest.com/docview/1818405612 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-WIW GBV_ILN_21 GBV_ILN_26 GBV_ILN_70 GBV_ILN_4126 85.35 AVZ 52.70 AVZ AR 54 2016 20 6052-6070
allfieldsSound	10.1080/00207543.2016.1166286 doi PQ20161012 (DE-627)OLC1981318143 (DE-599)GBVOLC1981318143 (PRQ)c1545-c129bf0669ec545bfddf48b8bdd089f4dce8b6c37d7621e1a7ee519955520790 (KEY)0019873020160000054002006052systemperformanceanalysisofflexibleflowshopwithmat DE-627 ger DE-627 rakwb eng 600 620 330 DNB 85.35 bkl 52.70 bkl Zhang, Hui-Yu verfasserin aut System performance analysis of flexible flow shop with match processing constraint 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 performance analysis queuing networks match processing constraint finite buffers Performance evaluation Queuing theory Markov analysis Methods Chen, Qing-Xin oth Mao, Ning oth Enthalten in International journal of production research London : Taylor & Francis, 1961 54(2016), 20, Seite 6052-6070 (DE-627)129358835 (DE-600)160477-6 (DE-576)014731150 0020-7543 nnns volume:54 year:2016 number:20 pages:6052-6070 http://dx.doi.org/10.1080/00207543.2016.1166286 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1166286 http://search.proquest.com/docview/1818405612 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-WIW GBV_ILN_21 GBV_ILN_26 GBV_ILN_70 GBV_ILN_4126 85.35 AVZ 52.70 AVZ AR 54 2016 20 6052-6070
language	English
source	Enthalten in International journal of production research 54(2016), 20, Seite 6052-6070 volume:54 year:2016 number:20 pages:6052-6070
sourceStr	Enthalten in International journal of production research 54(2016), 20, Seite 6052-6070 volume:54 year:2016 number:20 pages:6052-6070
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	performance analysis queuing networks match processing constraint finite buffers Performance evaluation Queuing theory Markov analysis Methods
dewey-raw	600
isfreeaccess_bool	false
container_title	International journal of production research
authorswithroles_txt_mv	Zhang, Hui-Yu @@aut@@ Chen, Qing-Xin @@oth@@ Mao, Ning @@oth@@
publishDateDaySort_date	2016-01-01T00:00:00Z
hierarchy_top_id	129358835
dewey-sort	3600
id	OLC1981318143
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1981318143</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221044806.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">161013s2016 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/00207543.2016.1166286</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20161012</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1981318143</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1981318143</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1545-c129bf0669ec545bfddf48b8bdd089f4dce8b6c37d7621e1a7ee519955520790</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0019873020160000054002006052systemperformanceanalysisofflexibleflowshopwithmat</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">600</subfield><subfield code="a">620</subfield><subfield code="a">330</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.35</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">52.70</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Hui-Yu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">System performance analysis of flexible flow shop with match processing constraint</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">performance analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">queuing networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">match processing constraint</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">finite buffers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Performance evaluation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Methods</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Qing-Xin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mao, Ning</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of production research</subfield><subfield code="d">London : Taylor & Francis, 1961</subfield><subfield code="g">54(2016), 20, Seite 6052-6070</subfield><subfield code="w">(DE-627)129358835</subfield><subfield code="w">(DE-600)160477-6</subfield><subfield code="w">(DE-576)014731150</subfield><subfield code="x">0020-7543</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:54</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:20</subfield><subfield code="g">pages:6052-6070</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/00207543.2016.1166286</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1166286</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1818405612</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.35</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">52.70</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">54</subfield><subfield code="j">2016</subfield><subfield code="e">20</subfield><subfield code="h">6052-6070</subfield></datafield></record></collection>
author	Zhang, Hui-Yu
spellingShingle	Zhang, Hui-Yu ddc 600 bkl 85.35 bkl 52.70 misc performance analysis misc queuing networks misc match processing constraint misc finite buffers misc Performance evaluation misc Queuing theory misc Markov analysis misc Methods System performance analysis of flexible flow shop with match processing constraint
authorStr	Zhang, Hui-Yu
ppnlink_with_tag_str_mv	@@773@@(DE-627)129358835
format	Article
dewey-ones	600 - Technology 620 - Engineering & allied operations 330 - Economics
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0020-7543
topic_title	600 620 330 DNB 85.35 bkl 52.70 bkl System performance analysis of flexible flow shop with match processing constraint performance analysis queuing networks match processing constraint finite buffers Performance evaluation Queuing theory Markov analysis Methods
topic	ddc 600 bkl 85.35 bkl 52.70 misc performance analysis misc queuing networks misc match processing constraint misc finite buffers misc Performance evaluation misc Queuing theory misc Markov analysis misc Methods
topic_unstemmed	ddc 600 bkl 85.35 bkl 52.70 misc performance analysis misc queuing networks misc match processing constraint misc finite buffers misc Performance evaluation misc Queuing theory misc Markov analysis misc Methods
topic_browse	ddc 600 bkl 85.35 bkl 52.70 misc performance analysis misc queuing networks misc match processing constraint misc finite buffers misc Performance evaluation misc Queuing theory misc Markov analysis misc Methods
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	q x c qxc n m nm
hierarchy_parent_title	International journal of production research
hierarchy_parent_id	129358835
dewey-tens	600 - Technology 620 - Engineering 330 - Economics
hierarchy_top_title	International journal of production research
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)129358835 (DE-600)160477-6 (DE-576)014731150
title	System performance analysis of flexible flow shop with match processing constraint
ctrlnum	(DE-627)OLC1981318143 (DE-599)GBVOLC1981318143 (PRQ)c1545-c129bf0669ec545bfddf48b8bdd089f4dce8b6c37d7621e1a7ee519955520790 (KEY)0019873020160000054002006052systemperformanceanalysisofflexibleflowshopwithmat
title_full	System performance analysis of flexible flow shop with match processing constraint
author_sort	Zhang, Hui-Yu
journal	International journal of production research
journalStr	International journal of production research
lang_code	eng
isOA_bool	false
dewey-hundreds	600 - Technology 300 - Social sciences
recordtype	marc
publishDateSort	2016
contenttype_str_mv	txt
container_start_page	6052
author_browse	Zhang, Hui-Yu
container_volume	54
class	600 620 330 DNB 85.35 bkl 52.70 bkl
format_se	Aufsätze
author-letter	Zhang, Hui-Yu
doi_str_mv	10.1080/00207543.2016.1166286
dewey-full	600 620 330
title_sort	system performance analysis of flexible flow shop with match processing constraint
title_auth	System performance analysis of flexible flow shop with match processing constraint
abstract	Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems.
abstractGer	Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems.
abstract_unstemmed	Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-WIW GBV_ILN_21 GBV_ILN_26 GBV_ILN_70 GBV_ILN_4126
container_issue	20
title_short	System performance analysis of flexible flow shop with match processing constraint
url	http://dx.doi.org/10.1080/00207543.2016.1166286 http://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1166286 http://search.proquest.com/docview/1818405612
remote_bool	false
author2	Chen, Qing-Xin Mao, Ning
author2Str	Chen, Qing-Xin Mao, Ning
ppnlink	129358835
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth oth
doi_str	10.1080/00207543.2016.1166286
up_date	2024-07-04T04:42:18.663Z
_version_	1803622168560402432
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1981318143</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221044806.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">161013s2016 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/00207543.2016.1166286</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20161012</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1981318143</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1981318143</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1545-c129bf0669ec545bfddf48b8bdd089f4dce8b6c37d7621e1a7ee519955520790</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0019873020160000054002006052systemperformanceanalysisofflexibleflowshopwithmat</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">600</subfield><subfield code="a">620</subfield><subfield code="a">330</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.35</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">52.70</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Hui-Yu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">System performance analysis of flexible flow shop with match processing constraint</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">performance analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">queuing networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">match processing constraint</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">finite buffers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Performance evaluation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Methods</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Qing-Xin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mao, Ning</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of production research</subfield><subfield code="d">London : Taylor & Francis, 1961</subfield><subfield code="g">54(2016), 20, Seite 6052-6070</subfield><subfield code="w">(DE-627)129358835</subfield><subfield code="w">(DE-600)160477-6</subfield><subfield code="w">(DE-576)014731150</subfield><subfield code="x">0020-7543</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:54</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:20</subfield><subfield code="g">pages:6052-6070</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/00207543.2016.1166286</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1166286</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1818405612</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.35</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">52.70</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">54</subfield><subfield code="j">2016</subfield><subfield code="e">20</subfield><subfield code="h">6052-6070</subfield></datafield></record></collection>
score	7.402237

Nicht das Richtige dabei?

Schreiben Sie uns!

System performance analysis of flexible flow shop with match processing constraint

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?