A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem : a robust optimization approach

Gespeichert in:

Autor*in:	Khajemahalle, Leila [verfasserIn] Emami, Saeed [verfasserIn] Keshteli, Ramezan Nemati [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2021

Schlagwörter:	Dynamic facility layout problem nested partitions algorithm robust optimization simulated annealing algorithm

Übergeordnetes Werk:	Enthalten in: INFOR - Abingdon : Taylor & Francis Group, 1979, 59(2021), 1, Seite 74-101
Übergeordnetes Werk:	volume:59 ; year:2021 ; number:1 ; pages:74-101

Links:	Link aufrufen Link aufrufen

DOI / URN:	10.1080/03155986.2020.1788328

Katalog-ID:	174764577X

Internformat


LEADER	01000naa a2200265 4500
001	174764577X
003	DE-627
005	20210205144015.0
007	cr uuu---uuuuu
008	210205s2021 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1080/03155986.2020.1788328 \|2 doi
035			\|a (DE-627)174764577X
035			\|a (DE-599)KXP174764577X
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
100	1		\|a Khajemahalle, Leila \|e verfasserin \|4 aut
245	1	2	\|a A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem \|b a robust optimization approach \|c Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli
264		1	\|c 2021
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
650		4	\|a Dynamic facility layout problem \|7 (dpeaa)DE-206
650		4	\|a nested partitions algorithm \|7 (dpeaa)DE-206
650		4	\|a robust optimization \|7 (dpeaa)DE-206
650		4	\|a simulated annealing algorithm \|7 (dpeaa)DE-206
700	1		\|a Emami, Saeed \|e verfasserin \|4 aut
700	1		\|a Keshteli, Ramezan Nemati \|e verfasserin \|0 (DE-588)1141832356 \|0 (DE-627)1000790940 \|0 (DE-576)494545100 \|4 aut
773	0	8	\|i Enthalten in \|t INFOR \|d Abingdon : Taylor & Francis Group, 1979 \|g 59(2021), 1, Seite 74-101 \|h Online-Ressource \|w (DE-627)266884989 \|w (DE-600)1468358-1 \|w (DE-576)104508841 \|x 1916-0615 \|7 nnns
773	1	8	\|g volume:59 \|g year:2021 \|g number:1 \|g pages:74-101
856	4	0	\|u https://www.tandfonline.com/doi/pdf/10.1080/03155986.2020.1788328 \|x Verlag \|z lizenzpflichtig
856	4	0	\|u https://doi.org/10.1080/03155986.2020.1788328 \|x Resolving-System \|z lizenzpflichtig
912			\|a GBV_USEFLAG_U
912			\|a GBV_ILN_26
912			\|a ISIL_DE-206
912			\|a SYSFLAG_1
912			\|a GBV_KXP
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_32
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_90
912			\|a GBV_ILN_95
912			\|a GBV_ILN_100
912			\|a GBV_ILN_101
912			\|a GBV_ILN_110
912			\|a GBV_ILN_120
912			\|a GBV_ILN_152
912			\|a GBV_ILN_224
912			\|a GBV_ILN_285
912			\|a GBV_ILN_370
912			\|a GBV_ILN_647
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2001
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2007
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2026
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2057
912			\|a GBV_ILN_2059
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2065
912			\|a GBV_ILN_2068
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2093
912			\|a GBV_ILN_2106
912			\|a GBV_ILN_2108
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2112
912			\|a GBV_ILN_2113
912			\|a GBV_ILN_2118
912			\|a GBV_ILN_2122
912			\|a GBV_ILN_2129
912			\|a GBV_ILN_2143
912			\|a GBV_ILN_2147
912			\|a GBV_ILN_2148
912			\|a GBV_ILN_2152
912			\|a GBV_ILN_2153
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2232
912			\|a GBV_ILN_2336
912			\|a GBV_ILN_2472
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_2548
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4246
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4393
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 59 \|j 2021 \|e 1 \|h 74-101
980			\|2 26 \|1 01 \|x 0206 \|b 3849425592 \|y x1z \|z 05-02-21

Indexfelder

author_variant	l k lk s e se r n k rn rnk
matchkey_str	article:19160615:2021----::hbinsepriinadiuaeanaigloihfryai
hierarchy_sort_str	2021
publishDate	2021
allfields	10.1080/03155986.2020.1788328 doi (DE-627)174764577X (DE-599)KXP174764577X DE-627 ger DE-627 rda eng Khajemahalle, Leila verfasserin aut A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Dynamic facility layout problem (dpeaa)DE-206 nested partitions algorithm (dpeaa)DE-206 robust optimization (dpeaa)DE-206 simulated annealing algorithm (dpeaa)DE-206 Emami, Saeed verfasserin aut Keshteli, Ramezan Nemati verfasserin (DE-588)1141832356 (DE-627)1000790940 (DE-576)494545100 aut Enthalten in INFOR Abingdon : Taylor & Francis Group, 1979 59(2021), 1, Seite 74-101 Online-Ressource (DE-627)266884989 (DE-600)1468358-1 (DE-576)104508841 1916-0615 nnns volume:59 year:2021 number:1 pages:74-101 https://www.tandfonline.com/doi/pdf/10.1080/03155986.2020.1788328 Verlag lizenzpflichtig https://doi.org/10.1080/03155986.2020.1788328 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 59 2021 1 74-101 26 01 0206 3849425592 x1z 05-02-21
spelling	10.1080/03155986.2020.1788328 doi (DE-627)174764577X (DE-599)KXP174764577X DE-627 ger DE-627 rda eng Khajemahalle, Leila verfasserin aut A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Dynamic facility layout problem (dpeaa)DE-206 nested partitions algorithm (dpeaa)DE-206 robust optimization (dpeaa)DE-206 simulated annealing algorithm (dpeaa)DE-206 Emami, Saeed verfasserin aut Keshteli, Ramezan Nemati verfasserin (DE-588)1141832356 (DE-627)1000790940 (DE-576)494545100 aut Enthalten in INFOR Abingdon : Taylor & Francis Group, 1979 59(2021), 1, Seite 74-101 Online-Ressource (DE-627)266884989 (DE-600)1468358-1 (DE-576)104508841 1916-0615 nnns volume:59 year:2021 number:1 pages:74-101 https://www.tandfonline.com/doi/pdf/10.1080/03155986.2020.1788328 Verlag lizenzpflichtig https://doi.org/10.1080/03155986.2020.1788328 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 59 2021 1 74-101 26 01 0206 3849425592 x1z 05-02-21
allfields_unstemmed	10.1080/03155986.2020.1788328 doi (DE-627)174764577X (DE-599)KXP174764577X DE-627 ger DE-627 rda eng Khajemahalle, Leila verfasserin aut A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Dynamic facility layout problem (dpeaa)DE-206 nested partitions algorithm (dpeaa)DE-206 robust optimization (dpeaa)DE-206 simulated annealing algorithm (dpeaa)DE-206 Emami, Saeed verfasserin aut Keshteli, Ramezan Nemati verfasserin (DE-588)1141832356 (DE-627)1000790940 (DE-576)494545100 aut Enthalten in INFOR Abingdon : Taylor & Francis Group, 1979 59(2021), 1, Seite 74-101 Online-Ressource (DE-627)266884989 (DE-600)1468358-1 (DE-576)104508841 1916-0615 nnns volume:59 year:2021 number:1 pages:74-101 https://www.tandfonline.com/doi/pdf/10.1080/03155986.2020.1788328 Verlag lizenzpflichtig https://doi.org/10.1080/03155986.2020.1788328 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 59 2021 1 74-101 26 01 0206 3849425592 x1z 05-02-21
allfieldsGer	10.1080/03155986.2020.1788328 doi (DE-627)174764577X (DE-599)KXP174764577X DE-627 ger DE-627 rda eng Khajemahalle, Leila verfasserin aut A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Dynamic facility layout problem (dpeaa)DE-206 nested partitions algorithm (dpeaa)DE-206 robust optimization (dpeaa)DE-206 simulated annealing algorithm (dpeaa)DE-206 Emami, Saeed verfasserin aut Keshteli, Ramezan Nemati verfasserin (DE-588)1141832356 (DE-627)1000790940 (DE-576)494545100 aut Enthalten in INFOR Abingdon : Taylor & Francis Group, 1979 59(2021), 1, Seite 74-101 Online-Ressource (DE-627)266884989 (DE-600)1468358-1 (DE-576)104508841 1916-0615 nnns volume:59 year:2021 number:1 pages:74-101 https://www.tandfonline.com/doi/pdf/10.1080/03155986.2020.1788328 Verlag lizenzpflichtig https://doi.org/10.1080/03155986.2020.1788328 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 59 2021 1 74-101 26 01 0206 3849425592 x1z 05-02-21
allfieldsSound	10.1080/03155986.2020.1788328 doi (DE-627)174764577X (DE-599)KXP174764577X DE-627 ger DE-627 rda eng Khajemahalle, Leila verfasserin aut A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Dynamic facility layout problem (dpeaa)DE-206 nested partitions algorithm (dpeaa)DE-206 robust optimization (dpeaa)DE-206 simulated annealing algorithm (dpeaa)DE-206 Emami, Saeed verfasserin aut Keshteli, Ramezan Nemati verfasserin (DE-588)1141832356 (DE-627)1000790940 (DE-576)494545100 aut Enthalten in INFOR Abingdon : Taylor & Francis Group, 1979 59(2021), 1, Seite 74-101 Online-Ressource (DE-627)266884989 (DE-600)1468358-1 (DE-576)104508841 1916-0615 nnns volume:59 year:2021 number:1 pages:74-101 https://www.tandfonline.com/doi/pdf/10.1080/03155986.2020.1788328 Verlag lizenzpflichtig https://doi.org/10.1080/03155986.2020.1788328 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 59 2021 1 74-101 26 01 0206 3849425592 x1z 05-02-21
language	English
source	Enthalten in INFOR 59(2021), 1, Seite 74-101 volume:59 year:2021 number:1 pages:74-101
sourceStr	Enthalten in INFOR 59(2021), 1, Seite 74-101 volume:59 year:2021 number:1 pages:74-101
format_phy_str_mv	Article
building	26:1
institution	findex.gbv.de
selectbib_iln_str_mv	26@1z
topic_facet	Dynamic facility layout problem nested partitions algorithm robust optimization simulated annealing algorithm
isfreeaccess_bool	false
container_title	INFOR
authorswithroles_txt_mv	Khajemahalle, Leila @@aut@@ Emami, Saeed @@aut@@ Keshteli, Ramezan Nemati @@aut@@
publishDateDaySort_date	2021-01-01T00:00:00Z
hierarchy_top_id	266884989
id	174764577X
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a2200265 4500</leader><controlfield tag="001">174764577X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210205144015.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210205s2021 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/03155986.2020.1788328</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)174764577X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP174764577X</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Khajemahalle, Leila</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem</subfield><subfield code="b">a robust optimization approach</subfield><subfield code="c">Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic facility layout problem</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">nested partitions algorithm</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">robust optimization</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">simulated annealing algorithm</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Emami, Saeed</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Keshteli, Ramezan Nemati</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1141832356</subfield><subfield code="0">(DE-627)1000790940</subfield><subfield code="0">(DE-576)494545100</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">INFOR</subfield><subfield code="d">Abingdon : Taylor & Francis Group, 1979</subfield><subfield code="g">59(2021), 1, Seite 74-101</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)266884989</subfield><subfield code="w">(DE-600)1468358-1</subfield><subfield code="w">(DE-576)104508841</subfield><subfield code="x">1916-0615</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:59</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:74-101</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tandfonline.com/doi/pdf/10.1080/03155986.2020.1788328</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1080/03155986.2020.1788328</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</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_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_647</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2472</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">59</subfield><subfield code="j">2021</subfield><subfield code="e">1</subfield><subfield code="h">74-101</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">3849425592</subfield><subfield code="y">x1z</subfield><subfield code="z">05-02-21</subfield></datafield></record></collection>
author	Khajemahalle, Leila
spellingShingle	Khajemahalle, Leila misc Dynamic facility layout problem misc nested partitions algorithm misc robust optimization misc simulated annealing algorithm A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach
authorStr	Khajemahalle, Leila
ppnlink_with_tag_str_mv	@@773@@(DE-627)266884989
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut
typewithnormlink_str_mv	DifferentiatedPerson@(DE-588)1141832356 Person@(DE-588)1141832356
collection	KXP GVK SWB
remote_str	true
last_changed_iln_str_mv	26@05-02-21
illustrated	Not Illustrated
issn	1916-0615
topic_title	A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli Dynamic facility layout problem (dpeaa)DE-206 nested partitions algorithm (dpeaa)DE-206 robust optimization (dpeaa)DE-206 simulated annealing algorithm (dpeaa)DE-206
topic	misc Dynamic facility layout problem misc nested partitions algorithm misc robust optimization misc simulated annealing algorithm
topic_unstemmed	misc Dynamic facility layout problem misc nested partitions algorithm misc robust optimization misc simulated annealing algorithm
topic_browse	misc Dynamic facility layout problem misc nested partitions algorithm misc robust optimization misc simulated annealing algorithm
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	INFOR
normlinkwithtype_str_mv	(DE-588)1141832356@DifferentiatedPerson (DE-588)1141832356@Person
hierarchy_parent_id	266884989
hierarchy_top_title	INFOR
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)266884989 (DE-600)1468358-1 (DE-576)104508841
normlinkwithrole_str_mv	(DE-588)1141832356@@aut@@
title	A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach
ctrlnum	(DE-627)174764577X (DE-599)KXP174764577X
title_full	A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli
author_sort	Khajemahalle, Leila
journal	INFOR
journalStr	INFOR
lang_code	eng
isOA_bool	false
recordtype	marc
publishDateSort	2021
contenttype_str_mv	txt
container_start_page	74
author_browse	Khajemahalle, Leila Emami, Saeed Keshteli, Ramezan Nemati
selectkey	26:x
container_volume	59
format_se	Elektronische Aufsätze
author-letter	Khajemahalle, Leila
title_sub	a robust optimization approach
doi_str_mv	10.1080/03155986.2020.1788328
normlink	1141832356 1000790940 494545100
normlink_prefix_str_mv	(DE-588)1141832356 (DE-627)1000790940 (DE-576)494545100
author2-role	verfasserin
title_sort	hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problema robust optimization approach
title_auth	A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem a robust optimization approach
collection_details	GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700
container_issue	1
title_short	A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem
url	https://www.tandfonline.com/doi/pdf/10.1080/03155986.2020.1788328 https://doi.org/10.1080/03155986.2020.1788328
ausleihindikator_str_mv	26
rolewithnormlink_str_mv	@@aut@@(DE-588)1141832356
remote_bool	true
author2	Emami, Saeed Keshteli, Ramezan Nemati
author2Str	Emami, Saeed Keshteli, Ramezan Nemati
ppnlink	266884989
GND_str_mv	Keshteli, R. N. Nemati Keshteli, Ramezan Keshteli, Ramezan Nemati
GND_txt_mv	Keshteli, R. N. Nemati Keshteli, Ramezan Keshteli, Ramezan Nemati
GND_txtF_mv	Keshteli, R. N. Nemati Keshteli, Ramezan Keshteli, Ramezan Nemati
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1080/03155986.2020.1788328
up_date	2024-07-04T10:59:26.462Z
_version_	1803645895535755265
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a2200265 4500</leader><controlfield tag="001">174764577X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210205144015.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210205s2021 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/03155986.2020.1788328</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)174764577X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP174764577X</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Khajemahalle, Leila</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem</subfield><subfield code="b">a robust optimization approach</subfield><subfield code="c">Leila Khajemahalle, Saeed Emami and Ramezan Nemati Keshteli</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic facility layout problem</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">nested partitions algorithm</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">robust optimization</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">simulated annealing algorithm</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Emami, Saeed</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Keshteli, Ramezan Nemati</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1141832356</subfield><subfield code="0">(DE-627)1000790940</subfield><subfield code="0">(DE-576)494545100</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">INFOR</subfield><subfield code="d">Abingdon : Taylor & Francis Group, 1979</subfield><subfield code="g">59(2021), 1, Seite 74-101</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)266884989</subfield><subfield code="w">(DE-600)1468358-1</subfield><subfield code="w">(DE-576)104508841</subfield><subfield code="x">1916-0615</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:59</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:74-101</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tandfonline.com/doi/pdf/10.1080/03155986.2020.1788328</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1080/03155986.2020.1788328</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</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_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_647</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2472</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">59</subfield><subfield code="j">2021</subfield><subfield code="e">1</subfield><subfield code="h">74-101</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">3849425592</subfield><subfield code="y">x1z</subfield><subfield code="z">05-02-21</subfield></datafield></record></collection>
score	7.4013615

Nicht das Richtige dabei?

Schreiben Sie uns!

A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem : a robust optimization approach

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?