A note on the complexity of two supply chain scheduling problems

DOI10.1007/S10951-021-00692-9MaRDI QIDQ2059093zbMATH OpenOpenAlexFDO

Authors Yuan Zhang, Jinjiang Yuan

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

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

Recommendations

• The complexity of two supply chain scheduling problems
• Supply chain scheduling in assembly systems
• scientific article; zbMATH DE number 5773643
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines
• Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines

Cites work

• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Coordinated supply chain management
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Supply Chain Scheduling: Batching and Delivery
• Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
• Supply chain scheduling: sequence coordination
• The complexity of two supply chain scheduling problems

Cited in

(5)

• The complexity of two supply chain scheduling problems
• Scheduling in a two-stage supply chain with uncertain parameters
• scientific article; zbMATH DE number 6832017 (Why is no real title available?)
• Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem
• Algorithmic Applications in Management

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059093)