Treffer: Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time

Title:
Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time
Authors:
Wei, Hongjun, Gao, Yuan, Yuan, Jinjiang
Source:
Discrete Applied Mathematics. 369:45-52
Publisher Information:
Elsevier BV, 2025.
Publication Year:
2025
Subject Terms:
transportation, Transportation, logistics and supply chain management, total weighted completion time, Deterministic scheduling theory in operations research, Analysis of algorithms and problem complexity, batching scheduling, unary NP-hard
Document Type:
Fachzeitschrift Article
File Description:
application/xml
Language:
English
ISSN:
0166-218X
DOI:
10.1016/j.dam.2025.02.023
Access URL:
https://zbmath.org/8028611
https://doi.org/10.1016/j.dam.2025.02.023
Rights:
Elsevier TDM
Accession Number:
edsair.doi.dedup.....26de94833f47bc01ed7af3dac831170a
Database:
OpenAIRE

Weitere Informationen

zbMATH Open Web Interface contents unavailable due to conflicting licenses.