Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time
We consider the coordination of transportation and batching scheduling with one single vehicle for minimizing total weighted completion time. The computational complexity of the problem with batch capacity of at least 2 was posed as open in the literature. For this problem, we show the unary NP-hard...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-09-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/7/9/819 |
| id |
doaj-7ee5bf9850e84f32960c4631af070fa5 |
|---|---|
| record_format |
Article |
| spelling |
doaj-7ee5bf9850e84f32960c4631af070fa52020-11-25T02:14:10ZengMDPI AGMathematics2227-73902019-09-017981910.3390/math7090819math7090819Transportation and Batching Scheduling for Minimizing Total Weighted Completion TimeHongjun Wei0Jinjiang Yuan1Yuan Gao2School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, ChinaSchool of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, ChinaSchool of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, ChinaWe consider the coordination of transportation and batching scheduling with one single vehicle for minimizing total weighted completion time. The computational complexity of the problem with batch capacity of at least 2 was posed as open in the literature. For this problem, we show the unary NP-hardness for every batch capacity at least 3 and present a polynomial-time 3-approximation algorithm when the batch capacity is at least 2.https://www.mdpi.com/2227-7390/7/9/819Transportationbatching schedulingtotal weighted completion timeunary NP-hardapproximation algorithm |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Hongjun Wei Jinjiang Yuan Yuan Gao |
| spellingShingle |
Hongjun Wei Jinjiang Yuan Yuan Gao Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time Mathematics Transportation batching scheduling total weighted completion time unary NP-hard approximation algorithm |
| author_facet |
Hongjun Wei Jinjiang Yuan Yuan Gao |
| author_sort |
Hongjun Wei |
| title |
Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time |
| title_short |
Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time |
| title_full |
Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time |
| title_fullStr |
Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time |
| title_full_unstemmed |
Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time |
| title_sort |
transportation and batching scheduling for minimizing total weighted completion time |
| publisher |
MDPI AG |
| series |
Mathematics |
| issn |
2227-7390 |
| publishDate |
2019-09-01 |
| description |
We consider the coordination of transportation and batching scheduling with one single vehicle for minimizing total weighted completion time. The computational complexity of the problem with batch capacity of at least 2 was posed as open in the literature. For this problem, we show the unary NP-hardness for every batch capacity at least 3 and present a polynomial-time 3-approximation algorithm when the batch capacity is at least 2. |
| topic |
Transportation batching scheduling total weighted completion time unary NP-hard approximation algorithm |
| url |
https://www.mdpi.com/2227-7390/7/9/819 |
| work_keys_str_mv |
AT hongjunwei transportationandbatchingschedulingforminimizingtotalweightedcompletiontime AT jinjiangyuan transportationandbatchingschedulingforminimizingtotalweightedcompletiontime AT yuangao transportationandbatchingschedulingforminimizingtotalweightedcompletiontime |
| _version_ |
1724901346337882112 |