A note on the complexity of two supply chain scheduling problems

DOI10.1007/s10951-021-00692-9zbMath1479.90108OpenAlexW3195169991MaRDI QIDQ2059093

Jinjiang Yuan, Yuan Zhang

Publication date: 13 December 2021

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-021-00692-9

zbMATH Keywords

computational complexityschedulingsupply chainsunary NP-hardness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Coordinated supply chain management
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Supply chain scheduling: sequence coordination
• The complexity of two supply chain scheduling problems
• Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
• Supply Chain Scheduling: Batching and Delivery

This page was built for publication: A note on the complexity of two supply chain scheduling problems