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: | Hongjun Wei, Jinjiang Yuan, Yuan Gao |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-09-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/7/9/819 |
Similar Items
-
Single machine batch processing problem with release dates to minimize total completion time
by: Pedram Beldar, et al.
Published: (2018-10-01) -
Two-Agent Pareto-Scheduling of Minimizing Total Weighted Completion Time and Total Weighted Late Work
by: Yuan Zhang, et al.
Published: (2020-11-01) -
Deterministic Scheduling Of Parallel Discrete And Batch Processors
by: Venkataramana, M
Published: (2009) -
Some Problems in One-Operator Scheduling
by: Baki, Mohammed Fazle
Published: (2006) -
Some Problems in One-Operator Scheduling
by: Baki, Mohammed Fazle
Published: (2006)