Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process
The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the...
Ausführliche Beschreibung
Autor*in: |
Chun Jiang [verfasserIn] Xiaofeng Hu [verfasserIn] Juntong Xi [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2019 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
In: Applied Sciences - MDPI AG, 2012, 9(2019), 5, p 885 |
---|---|
Übergeordnetes Werk: |
volume:9 ; year:2019 ; number:5, p 885 |
Links: |
---|
DOI / URN: |
10.3390/app9050885 |
---|
Katalog-ID: |
DOAJ008737932 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | DOAJ008737932 | ||
003 | DE-627 | ||
005 | 20230310013330.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230225s2019 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.3390/app9050885 |2 doi | |
035 | |a (DE-627)DOAJ008737932 | ||
035 | |a (DE-599)DOAJ6be03beb24874cc3891ec798a384e105 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
050 | 0 | |a TA1-2040 | |
050 | 0 | |a QH301-705.5 | |
050 | 0 | |a QC1-999 | |
050 | 0 | |a QD1-999 | |
100 | 0 | |a Chun Jiang |e verfasserin |4 aut | |
245 | 1 | 0 | |a Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process |
264 | 1 | |c 2019 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager. | ||
650 | 4 | |a engineer-to-order | |
650 | 4 | |a multi-project scheduling | |
650 | 4 | |a hierarchical workforce | |
650 | 4 | |a worker allocation | |
650 | 4 | |a particle swarm optimization | |
650 | 4 | |a Tabu search | |
653 | 0 | |a Technology | |
653 | 0 | |a T | |
653 | 0 | |a Engineering (General). Civil engineering (General) | |
653 | 0 | |a Biology (General) | |
653 | 0 | |a Physics | |
653 | 0 | |a Chemistry | |
700 | 0 | |a Xiaofeng Hu |e verfasserin |4 aut | |
700 | 0 | |a Juntong Xi |e verfasserin |4 aut | |
773 | 0 | 8 | |i In |t Applied Sciences |d MDPI AG, 2012 |g 9(2019), 5, p 885 |w (DE-627)737287640 |w (DE-600)2704225-X |x 20763417 |7 nnns |
773 | 1 | 8 | |g volume:9 |g year:2019 |g number:5, p 885 |
856 | 4 | 0 | |u https://doi.org/10.3390/app9050885 |z kostenfrei |
856 | 4 | 0 | |u https://doaj.org/article/6be03beb24874cc3891ec798a384e105 |z kostenfrei |
856 | 4 | 0 | |u http://www.mdpi.com/2076-3417/9/5/885 |z kostenfrei |
856 | 4 | 2 | |u https://doaj.org/toc/2076-3417 |y Journal toc |z kostenfrei |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_DOAJ | ||
912 | |a GBV_ILN_11 | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
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_171 | ||
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_2055 | ||
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_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4367 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 9 |j 2019 |e 5, p 885 |
author_variant |
c j cj x h xh j x jx |
---|---|
matchkey_str |
article:20763417:2019----::nertdutpoetceuignheaciawrfreloain |
hierarchy_sort_str |
2019 |
callnumber-subject-code |
TA |
publishDate |
2019 |
allfields |
10.3390/app9050885 doi (DE-627)DOAJ008737932 (DE-599)DOAJ6be03beb24874cc3891ec798a384e105 DE-627 ger DE-627 rakwb eng TA1-2040 QH301-705.5 QC1-999 QD1-999 Chun Jiang verfasserin aut Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager. engineer-to-order multi-project scheduling hierarchical workforce worker allocation particle swarm optimization Tabu search Technology T Engineering (General). Civil engineering (General) Biology (General) Physics Chemistry Xiaofeng Hu verfasserin aut Juntong Xi verfasserin aut In Applied Sciences MDPI AG, 2012 9(2019), 5, p 885 (DE-627)737287640 (DE-600)2704225-X 20763417 nnns volume:9 year:2019 number:5, p 885 https://doi.org/10.3390/app9050885 kostenfrei https://doaj.org/article/6be03beb24874cc3891ec798a384e105 kostenfrei http://www.mdpi.com/2076-3417/9/5/885 kostenfrei https://doaj.org/toc/2076-3417 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_171 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2055 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 9 2019 5, p 885 |
spelling |
10.3390/app9050885 doi (DE-627)DOAJ008737932 (DE-599)DOAJ6be03beb24874cc3891ec798a384e105 DE-627 ger DE-627 rakwb eng TA1-2040 QH301-705.5 QC1-999 QD1-999 Chun Jiang verfasserin aut Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager. engineer-to-order multi-project scheduling hierarchical workforce worker allocation particle swarm optimization Tabu search Technology T Engineering (General). Civil engineering (General) Biology (General) Physics Chemistry Xiaofeng Hu verfasserin aut Juntong Xi verfasserin aut In Applied Sciences MDPI AG, 2012 9(2019), 5, p 885 (DE-627)737287640 (DE-600)2704225-X 20763417 nnns volume:9 year:2019 number:5, p 885 https://doi.org/10.3390/app9050885 kostenfrei https://doaj.org/article/6be03beb24874cc3891ec798a384e105 kostenfrei http://www.mdpi.com/2076-3417/9/5/885 kostenfrei https://doaj.org/toc/2076-3417 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_171 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2055 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 9 2019 5, p 885 |
allfields_unstemmed |
10.3390/app9050885 doi (DE-627)DOAJ008737932 (DE-599)DOAJ6be03beb24874cc3891ec798a384e105 DE-627 ger DE-627 rakwb eng TA1-2040 QH301-705.5 QC1-999 QD1-999 Chun Jiang verfasserin aut Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager. engineer-to-order multi-project scheduling hierarchical workforce worker allocation particle swarm optimization Tabu search Technology T Engineering (General). Civil engineering (General) Biology (General) Physics Chemistry Xiaofeng Hu verfasserin aut Juntong Xi verfasserin aut In Applied Sciences MDPI AG, 2012 9(2019), 5, p 885 (DE-627)737287640 (DE-600)2704225-X 20763417 nnns volume:9 year:2019 number:5, p 885 https://doi.org/10.3390/app9050885 kostenfrei https://doaj.org/article/6be03beb24874cc3891ec798a384e105 kostenfrei http://www.mdpi.com/2076-3417/9/5/885 kostenfrei https://doaj.org/toc/2076-3417 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_171 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2055 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 9 2019 5, p 885 |
allfieldsGer |
10.3390/app9050885 doi (DE-627)DOAJ008737932 (DE-599)DOAJ6be03beb24874cc3891ec798a384e105 DE-627 ger DE-627 rakwb eng TA1-2040 QH301-705.5 QC1-999 QD1-999 Chun Jiang verfasserin aut Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager. engineer-to-order multi-project scheduling hierarchical workforce worker allocation particle swarm optimization Tabu search Technology T Engineering (General). Civil engineering (General) Biology (General) Physics Chemistry Xiaofeng Hu verfasserin aut Juntong Xi verfasserin aut In Applied Sciences MDPI AG, 2012 9(2019), 5, p 885 (DE-627)737287640 (DE-600)2704225-X 20763417 nnns volume:9 year:2019 number:5, p 885 https://doi.org/10.3390/app9050885 kostenfrei https://doaj.org/article/6be03beb24874cc3891ec798a384e105 kostenfrei http://www.mdpi.com/2076-3417/9/5/885 kostenfrei https://doaj.org/toc/2076-3417 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_171 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2055 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 9 2019 5, p 885 |
allfieldsSound |
10.3390/app9050885 doi (DE-627)DOAJ008737932 (DE-599)DOAJ6be03beb24874cc3891ec798a384e105 DE-627 ger DE-627 rakwb eng TA1-2040 QH301-705.5 QC1-999 QD1-999 Chun Jiang verfasserin aut Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager. engineer-to-order multi-project scheduling hierarchical workforce worker allocation particle swarm optimization Tabu search Technology T Engineering (General). Civil engineering (General) Biology (General) Physics Chemistry Xiaofeng Hu verfasserin aut Juntong Xi verfasserin aut In Applied Sciences MDPI AG, 2012 9(2019), 5, p 885 (DE-627)737287640 (DE-600)2704225-X 20763417 nnns volume:9 year:2019 number:5, p 885 https://doi.org/10.3390/app9050885 kostenfrei https://doaj.org/article/6be03beb24874cc3891ec798a384e105 kostenfrei http://www.mdpi.com/2076-3417/9/5/885 kostenfrei https://doaj.org/toc/2076-3417 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_171 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2055 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 9 2019 5, p 885 |
language |
English |
source |
In Applied Sciences 9(2019), 5, p 885 volume:9 year:2019 number:5, p 885 |
sourceStr |
In Applied Sciences 9(2019), 5, p 885 volume:9 year:2019 number:5, p 885 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
engineer-to-order multi-project scheduling hierarchical workforce worker allocation particle swarm optimization Tabu search Technology T Engineering (General). Civil engineering (General) Biology (General) Physics Chemistry |
isfreeaccess_bool |
true |
container_title |
Applied Sciences |
authorswithroles_txt_mv |
Chun Jiang @@aut@@ Xiaofeng Hu @@aut@@ Juntong Xi @@aut@@ |
publishDateDaySort_date |
2019-01-01T00:00:00Z |
hierarchy_top_id |
737287640 |
id |
DOAJ008737932 |
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">DOAJ008737932</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310013330.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/app9050885</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ008737932</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ6be03beb24874cc3891ec798a384e105</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">TA1-2040</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QH301-705.5</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QC1-999</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QD1-999</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Chun Jiang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</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">The engineer-to-order (ETO) production strategy plays an important role in today&rsquo;s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">engineer-to-order</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">multi-project scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">hierarchical workforce</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">worker allocation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">particle swarm optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tabu search</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">T</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Engineering (General). Civil engineering (General)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Biology (General)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Physics</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Chemistry</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Xiaofeng Hu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Juntong Xi</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">Applied Sciences</subfield><subfield code="d">MDPI AG, 2012</subfield><subfield code="g">9(2019), 5, p 885</subfield><subfield code="w">(DE-627)737287640</subfield><subfield code="w">(DE-600)2704225-X</subfield><subfield code="x">20763417</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:5, p 885</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/app9050885</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/6be03beb24874cc3891ec798a384e105</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.mdpi.com/2076-3417/9/5/885</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2076-3417</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_11</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_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_171</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_2055</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_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">9</subfield><subfield code="j">2019</subfield><subfield code="e">5, p 885</subfield></datafield></record></collection>
|
callnumber-first |
T - Technology |
author |
Chun Jiang |
spellingShingle |
Chun Jiang misc TA1-2040 misc QH301-705.5 misc QC1-999 misc QD1-999 misc engineer-to-order misc multi-project scheduling misc hierarchical workforce misc worker allocation misc particle swarm optimization misc Tabu search misc Technology misc T misc Engineering (General). Civil engineering (General) misc Biology (General) misc Physics misc Chemistry Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process |
authorStr |
Chun Jiang |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)737287640 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut aut |
collection |
DOAJ |
remote_str |
true |
callnumber-label |
TA1-2040 |
illustrated |
Not Illustrated |
issn |
20763417 |
topic_title |
TA1-2040 QH301-705.5 QC1-999 QD1-999 Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process engineer-to-order multi-project scheduling hierarchical workforce worker allocation particle swarm optimization Tabu search |
topic |
misc TA1-2040 misc QH301-705.5 misc QC1-999 misc QD1-999 misc engineer-to-order misc multi-project scheduling misc hierarchical workforce misc worker allocation misc particle swarm optimization misc Tabu search misc Technology misc T misc Engineering (General). Civil engineering (General) misc Biology (General) misc Physics misc Chemistry |
topic_unstemmed |
misc TA1-2040 misc QH301-705.5 misc QC1-999 misc QD1-999 misc engineer-to-order misc multi-project scheduling misc hierarchical workforce misc worker allocation misc particle swarm optimization misc Tabu search misc Technology misc T misc Engineering (General). Civil engineering (General) misc Biology (General) misc Physics misc Chemistry |
topic_browse |
misc TA1-2040 misc QH301-705.5 misc QC1-999 misc QD1-999 misc engineer-to-order misc multi-project scheduling misc hierarchical workforce misc worker allocation misc particle swarm optimization misc Tabu search misc Technology misc T misc Engineering (General). Civil engineering (General) misc Biology (General) misc Physics misc Chemistry |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Applied Sciences |
hierarchy_parent_id |
737287640 |
hierarchy_top_title |
Applied Sciences |
isfreeaccess_txt |
true |
familylinks_str_mv |
(DE-627)737287640 (DE-600)2704225-X |
title |
Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process |
ctrlnum |
(DE-627)DOAJ008737932 (DE-599)DOAJ6be03beb24874cc3891ec798a384e105 |
title_full |
Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process |
author_sort |
Chun Jiang |
journal |
Applied Sciences |
journalStr |
Applied Sciences |
callnumber-first-code |
T |
lang_code |
eng |
isOA_bool |
true |
recordtype |
marc |
publishDateSort |
2019 |
contenttype_str_mv |
txt |
author_browse |
Chun Jiang Xiaofeng Hu Juntong Xi |
container_volume |
9 |
class |
TA1-2040 QH301-705.5 QC1-999 QD1-999 |
format_se |
Elektronische Aufsätze |
author-letter |
Chun Jiang |
doi_str_mv |
10.3390/app9050885 |
author2-role |
verfasserin |
title_sort |
integrated multi-project scheduling and hierarchical workforce allocation in the eto assembly process |
callnumber |
TA1-2040 |
title_auth |
Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process |
abstract |
The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager. |
abstractGer |
The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager. |
abstract_unstemmed |
The engineer-to-order (ETO) production strategy plays an important role in today’s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_171 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2055 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 |
container_issue |
5, p 885 |
title_short |
Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process |
url |
https://doi.org/10.3390/app9050885 https://doaj.org/article/6be03beb24874cc3891ec798a384e105 http://www.mdpi.com/2076-3417/9/5/885 https://doaj.org/toc/2076-3417 |
remote_bool |
true |
author2 |
Xiaofeng Hu Juntong Xi |
author2Str |
Xiaofeng Hu Juntong Xi |
ppnlink |
737287640 |
callnumber-subject |
TA - General and Civil Engineering |
mediatype_str_mv |
c |
isOA_txt |
true |
hochschulschrift_bool |
false |
doi_str |
10.3390/app9050885 |
callnumber-a |
TA1-2040 |
up_date |
2024-07-03T19:48:02.140Z |
_version_ |
1803588554868129792 |
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">DOAJ008737932</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310013330.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/app9050885</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ008737932</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ6be03beb24874cc3891ec798a384e105</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">TA1-2040</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QH301-705.5</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QC1-999</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QD1-999</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Chun Jiang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Integrated Multi-Project Scheduling and Hierarchical Workforce Allocation in the ETO Assembly Process</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</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">The engineer-to-order (ETO) production strategy plays an important role in today&rsquo;s manufacturing industry. This paper studies integrated multi-project scheduling and hierarchical workforce allocation in the assembly process of ETO products. The multi-project scheduling problem involves the scheduling of tasks of different projects under many constraints, and the workforce allocation problem involves assigning hierarchical workers to each task. These two problems are interrelated. The task duration depends on the number of hierarchical workers assigned to the task. We developed a mathematical model to represent the problem. In order to solve this issue with the minimization of the makespan as the objective, we propose a hybrid algorithm combining particle swarm optimization (PSO) and Tabu search (TS). The improved PSO is designed as the global search process and the Tabu search is introduced to improve the local searching ability. The proposed algorithm is tested on different scales of benchmark instances and a case that uses industrial data from a collaborating steam turbine company. The results show that the solution quality of the hybrid algorithm outperforms the other three algorithms proposed in the literature and the experienced project manager.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">engineer-to-order</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">multi-project scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">hierarchical workforce</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">worker allocation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">particle swarm optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tabu search</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">T</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Engineering (General). Civil engineering (General)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Biology (General)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Physics</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Chemistry</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Xiaofeng Hu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Juntong Xi</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">Applied Sciences</subfield><subfield code="d">MDPI AG, 2012</subfield><subfield code="g">9(2019), 5, p 885</subfield><subfield code="w">(DE-627)737287640</subfield><subfield code="w">(DE-600)2704225-X</subfield><subfield code="x">20763417</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:5, p 885</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/app9050885</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/6be03beb24874cc3891ec798a384e105</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.mdpi.com/2076-3417/9/5/885</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2076-3417</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_11</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_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_171</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_2055</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_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">9</subfield><subfield code="j">2019</subfield><subfield code="e">5, p 885</subfield></datafield></record></collection>
|
score |
7.402916 |