Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time

Hongjun Wei, Jinjiang Yuan and Yuan Gao
Additional contact information
Hongjun Wei: School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China
Jinjiang Yuan: School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China
Yuan Gao: School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China

Mathematics, 2019, vol. 7, issue 9, 1-10

Abstract: 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.

Keywords: Transportation; batching scheduling; total weighted completion time; unary NP-hard; approximation algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/9/819/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/9/819/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:9:p:819-:d:264520

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().