A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing

Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) sc...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Lindong Liu [verfasserIn] Zhenyu Wu [verfasserIn] Yugang Yu [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2023

Schlagwörter:	Single-machine scheduling Branch and price Labelling algorithm Additive manufacturing

Übergeordnetes Werk:	In: Journal of Management Science and Engineering - KeAi Communications Co., Ltd., 2020, 8(2023), 2, Seite 273-286
Übergeordnetes Werk:	volume:8 ; year:2023 ; number:2 ; pages:273-286

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.1016/j.jmse.2022.10.001

Katalog-ID:	DOAJ088487849

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ088487849
003	DE-627
005	20230526110400.0
007	cr uuu---uuuuu
008	230410s2023 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1016/j.jmse.2022.10.001 \|2 doi
035			\|a (DE-627)DOAJ088487849
035			\|a (DE-599)DOAJd6163038a06445dab3aebf564d7f49c9
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a T55.4-60.8
100	0		\|a Lindong Liu \|e verfasserin \|4 aut
245	1	2	\|a A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing
264		1	\|c 2023
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.
650		4	\|a Single-machine scheduling
650		4	\|a Branch and price
650		4	\|a Labelling algorithm
650		4	\|a Additive manufacturing
653		0	\|a Industrial engineering. Management engineering
700	0		\|a Zhenyu Wu \|e verfasserin \|4 aut
700	0		\|a Yugang Yu \|e verfasserin \|4 aut
773	0	8	\|i In \|t Journal of Management Science and Engineering \|d KeAi Communications Co., Ltd., 2020 \|g 8(2023), 2, Seite 273-286 \|w (DE-627)1665781963 \|w (DE-600)2972364-4 \|x 25895532 \|7 nnns
773	1	8	\|g volume:8 \|g year:2023 \|g number:2 \|g pages:273-286
856	4	0	\|u https://doi.org/10.1016/j.jmse.2022.10.001 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/d6163038a06445dab3aebf564d7f49c9 \|z kostenfrei
856	4	0	\|u http://www.sciencedirect.com/science/article/pii/S209623202200052X \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2096-2320 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
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_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_206
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
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_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 8 \|j 2023 \|e 2 \|h 273-286

Indexfelder

author_variant	l l ll z w zw y y yy
matchkey_str	article:25895532:2023----::bacadrcagrtmoefrsnlmcieceuigoa
hierarchy_sort_str	2023
callnumber-subject-code	T
publishDate	2023
allfields	10.1016/j.jmse.2022.10.001 doi (DE-627)DOAJ088487849 (DE-599)DOAJd6163038a06445dab3aebf564d7f49c9 DE-627 ger DE-627 rakwb eng T55.4-60.8 Lindong Liu verfasserin aut A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances. Single-machine scheduling Branch and price Labelling algorithm Additive manufacturing Industrial engineering. Management engineering Zhenyu Wu verfasserin aut Yugang Yu verfasserin aut In Journal of Management Science and Engineering KeAi Communications Co., Ltd., 2020 8(2023), 2, Seite 273-286 (DE-627)1665781963 (DE-600)2972364-4 25895532 nnns volume:8 year:2023 number:2 pages:273-286 https://doi.org/10.1016/j.jmse.2022.10.001 kostenfrei https://doaj.org/article/d6163038a06445dab3aebf564d7f49c9 kostenfrei http://www.sciencedirect.com/science/article/pii/S209623202200052X kostenfrei https://doaj.org/toc/2096-2320 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 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_4367 GBV_ILN_4700 AR 8 2023 2 273-286
spelling	10.1016/j.jmse.2022.10.001 doi (DE-627)DOAJ088487849 (DE-599)DOAJd6163038a06445dab3aebf564d7f49c9 DE-627 ger DE-627 rakwb eng T55.4-60.8 Lindong Liu verfasserin aut A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances. Single-machine scheduling Branch and price Labelling algorithm Additive manufacturing Industrial engineering. Management engineering Zhenyu Wu verfasserin aut Yugang Yu verfasserin aut In Journal of Management Science and Engineering KeAi Communications Co., Ltd., 2020 8(2023), 2, Seite 273-286 (DE-627)1665781963 (DE-600)2972364-4 25895532 nnns volume:8 year:2023 number:2 pages:273-286 https://doi.org/10.1016/j.jmse.2022.10.001 kostenfrei https://doaj.org/article/d6163038a06445dab3aebf564d7f49c9 kostenfrei http://www.sciencedirect.com/science/article/pii/S209623202200052X kostenfrei https://doaj.org/toc/2096-2320 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 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_4367 GBV_ILN_4700 AR 8 2023 2 273-286
allfields_unstemmed	10.1016/j.jmse.2022.10.001 doi (DE-627)DOAJ088487849 (DE-599)DOAJd6163038a06445dab3aebf564d7f49c9 DE-627 ger DE-627 rakwb eng T55.4-60.8 Lindong Liu verfasserin aut A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances. Single-machine scheduling Branch and price Labelling algorithm Additive manufacturing Industrial engineering. Management engineering Zhenyu Wu verfasserin aut Yugang Yu verfasserin aut In Journal of Management Science and Engineering KeAi Communications Co., Ltd., 2020 8(2023), 2, Seite 273-286 (DE-627)1665781963 (DE-600)2972364-4 25895532 nnns volume:8 year:2023 number:2 pages:273-286 https://doi.org/10.1016/j.jmse.2022.10.001 kostenfrei https://doaj.org/article/d6163038a06445dab3aebf564d7f49c9 kostenfrei http://www.sciencedirect.com/science/article/pii/S209623202200052X kostenfrei https://doaj.org/toc/2096-2320 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 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_4367 GBV_ILN_4700 AR 8 2023 2 273-286
allfieldsGer	10.1016/j.jmse.2022.10.001 doi (DE-627)DOAJ088487849 (DE-599)DOAJd6163038a06445dab3aebf564d7f49c9 DE-627 ger DE-627 rakwb eng T55.4-60.8 Lindong Liu verfasserin aut A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances. Single-machine scheduling Branch and price Labelling algorithm Additive manufacturing Industrial engineering. Management engineering Zhenyu Wu verfasserin aut Yugang Yu verfasserin aut In Journal of Management Science and Engineering KeAi Communications Co., Ltd., 2020 8(2023), 2, Seite 273-286 (DE-627)1665781963 (DE-600)2972364-4 25895532 nnns volume:8 year:2023 number:2 pages:273-286 https://doi.org/10.1016/j.jmse.2022.10.001 kostenfrei https://doaj.org/article/d6163038a06445dab3aebf564d7f49c9 kostenfrei http://www.sciencedirect.com/science/article/pii/S209623202200052X kostenfrei https://doaj.org/toc/2096-2320 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 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_4367 GBV_ILN_4700 AR 8 2023 2 273-286
allfieldsSound	10.1016/j.jmse.2022.10.001 doi (DE-627)DOAJ088487849 (DE-599)DOAJd6163038a06445dab3aebf564d7f49c9 DE-627 ger DE-627 rakwb eng T55.4-60.8 Lindong Liu verfasserin aut A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances. Single-machine scheduling Branch and price Labelling algorithm Additive manufacturing Industrial engineering. Management engineering Zhenyu Wu verfasserin aut Yugang Yu verfasserin aut In Journal of Management Science and Engineering KeAi Communications Co., Ltd., 2020 8(2023), 2, Seite 273-286 (DE-627)1665781963 (DE-600)2972364-4 25895532 nnns volume:8 year:2023 number:2 pages:273-286 https://doi.org/10.1016/j.jmse.2022.10.001 kostenfrei https://doaj.org/article/d6163038a06445dab3aebf564d7f49c9 kostenfrei http://www.sciencedirect.com/science/article/pii/S209623202200052X kostenfrei https://doaj.org/toc/2096-2320 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 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_4367 GBV_ILN_4700 AR 8 2023 2 273-286
language	English
source	In Journal of Management Science and Engineering 8(2023), 2, Seite 273-286 volume:8 year:2023 number:2 pages:273-286
sourceStr	In Journal of Management Science and Engineering 8(2023), 2, Seite 273-286 volume:8 year:2023 number:2 pages:273-286
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Single-machine scheduling Branch and price Labelling algorithm Additive manufacturing Industrial engineering. Management engineering
isfreeaccess_bool	true
container_title	Journal of Management Science and Engineering
authorswithroles_txt_mv	Lindong Liu @@aut@@ Zhenyu Wu @@aut@@ Yugang Yu @@aut@@
publishDateDaySort_date	2023-01-01T00:00:00Z
hierarchy_top_id	1665781963
id	DOAJ088487849
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ088487849</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230526110400.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230410s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.jmse.2022.10.001</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ088487849</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJd6163038a06445dab3aebf564d7f49c9</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="050" ind1=" " ind2="0"><subfield code="a">T55.4-60.8</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Lindong Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</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="520" ind1=" " ind2=" "><subfield code="a">Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single-machine scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and price</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Labelling algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Additive manufacturing</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Industrial engineering. Management engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhenyu Wu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yugang Yu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of Management Science and Engineering</subfield><subfield code="d">KeAi Communications Co., Ltd., 2020</subfield><subfield code="g">8(2023), 2, Seite 273-286</subfield><subfield code="w">(DE-627)1665781963</subfield><subfield code="w">(DE-600)2972364-4</subfield><subfield code="x">25895532</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:273-286</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.jmse.2022.10.001</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/d6163038a06445dab3aebf564d7f49c9</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/article/pii/S209623202200052X</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2096-2320</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</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_DOAJ</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_39</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_65</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_73</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_105</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_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</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_293</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_602</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_4012</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_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_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_4367</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">8</subfield><subfield code="j">2023</subfield><subfield code="e">2</subfield><subfield code="h">273-286</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Lindong Liu
spellingShingle	Lindong Liu misc T55.4-60.8 misc Single-machine scheduling misc Branch and price misc Labelling algorithm misc Additive manufacturing misc Industrial engineering. Management engineering A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing
authorStr	Lindong Liu
ppnlink_with_tag_str_mv	@@773@@(DE-627)1665781963
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	T55
illustrated	Not Illustrated
issn	25895532
topic_title	T55.4-60.8 A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing Single-machine scheduling Branch and price Labelling algorithm Additive manufacturing
topic	misc T55.4-60.8 misc Single-machine scheduling misc Branch and price misc Labelling algorithm misc Additive manufacturing misc Industrial engineering. Management engineering
topic_unstemmed	misc T55.4-60.8 misc Single-machine scheduling misc Branch and price misc Labelling algorithm misc Additive manufacturing misc Industrial engineering. Management engineering
topic_browse	misc T55.4-60.8 misc Single-machine scheduling misc Branch and price misc Labelling algorithm misc Additive manufacturing misc Industrial engineering. Management engineering
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Journal of Management Science and Engineering
hierarchy_parent_id	1665781963
hierarchy_top_title	Journal of Management Science and Engineering
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)1665781963 (DE-600)2972364-4
title	A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing
ctrlnum	(DE-627)DOAJ088487849 (DE-599)DOAJd6163038a06445dab3aebf564d7f49c9
title_full	A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing
author_sort	Lindong Liu
journal	Journal of Management Science and Engineering
journalStr	Journal of Management Science and Engineering
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2023
contenttype_str_mv	txt
container_start_page	273
author_browse	Lindong Liu Zhenyu Wu Yugang Yu
container_volume	8
class	T55.4-60.8
format_se	Elektronische Aufsätze
author-letter	Lindong Liu
doi_str_mv	10.1016/j.jmse.2022.10.001
author2-role	verfasserin
title_sort	branch-and-price algorithm to perform single-machine scheduling for additive manufacturing
callnumber	T55.4-60.8
title_auth	A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing
abstract	Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.
abstractGer	Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.
abstract_unstemmed	Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 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_4367 GBV_ILN_4700
container_issue	2
title_short	A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing
url	https://doi.org/10.1016/j.jmse.2022.10.001 https://doaj.org/article/d6163038a06445dab3aebf564d7f49c9 http://www.sciencedirect.com/science/article/pii/S209623202200052X https://doaj.org/toc/2096-2320
remote_bool	true
author2	Zhenyu Wu Yugang Yu
author2Str	Zhenyu Wu Yugang Yu
ppnlink	1665781963
callnumber-subject	T - General Technology
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1016/j.jmse.2022.10.001
callnumber-a	T55.4-60.8
up_date	2024-07-03T17:57:18.608Z
_version_	1803581588625162240
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ088487849</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230526110400.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230410s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.jmse.2022.10.001</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ088487849</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJd6163038a06445dab3aebf564d7f49c9</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="050" ind1=" " ind2="0"><subfield code="a">T55.4-60.8</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Lindong Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</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="520" ind1=" " ind2=" "><subfield code="a">Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single-machine scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and price</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Labelling algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Additive manufacturing</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Industrial engineering. Management engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhenyu Wu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yugang Yu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of Management Science and Engineering</subfield><subfield code="d">KeAi Communications Co., Ltd., 2020</subfield><subfield code="g">8(2023), 2, Seite 273-286</subfield><subfield code="w">(DE-627)1665781963</subfield><subfield code="w">(DE-600)2972364-4</subfield><subfield code="x">25895532</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:273-286</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.jmse.2022.10.001</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/d6163038a06445dab3aebf564d7f49c9</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/article/pii/S209623202200052X</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2096-2320</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</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_DOAJ</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_39</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_65</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_73</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_105</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_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</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_293</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_602</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_4012</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_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_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_4367</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">8</subfield><subfield code="j">2023</subfield><subfield code="e">2</subfield><subfield code="h">273-286</subfield></datafield></record></collection>
score	7.399276

Nicht das Richtige dabei?

Schreiben Sie uns!

A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?