The complexity of two supply chain scheduling problems

DOI10.1016/j.ipl.2013.05.005zbMath1285.90009MaRDI QIDQ2444850

Jianfeng Ren, Da-Chuan Xu, Dong-lei Du

Publication date: 11 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.05.005

zbMATH Keywords

computational complexity; NP-complete; supply chains; manufacturing and scheduling

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Two-machine flow-shop scheduling to minimize total late work: revisited, Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work, A note on the complexity of two supply chain scheduling problems, Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works, Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

Cites Work

• Unnamed Item
• Coordinated supply chain management
• Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
• Supply Chain Scheduling: Batching and Delivery
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Machine scheduling with transportation considerations