Optimal scheduling of a single-supplier single-manufacturer supply chain with common due windows

Keyphrases

• Supply Chain 100%
• Optimal Scheduling 100%
• Common Due Window 100%
• Storage Time 100%
• Idle Time 100%
• Single Manufacturer 100%
• Two-machine 50%
• Retailers 50%
• Due Date 50%
• Control Problem 50%
• NP-hard 50%
• Computational Effort 50%
• Shortest Processing Time 50%
• Flow Shop Scheduling Problem 50%
• Optimal Schedule 50%
• Pseudo-polynomial Algorithm 50%
• Due Window 50%
• Storage Cost 50%
• Large-sized 50%
• Proportionate Flowshop 50%
• Multiple Retailers 50%
• Ordered Sequences 50%
• Limited Production Capacity 50%
• Tight Upper Bound 50%
• Permutation Schedule 50%
• Scheduling Control 50%
• Sequence-dependent 50%
• Supply Chain Scheduling 50%

Mathematics

• Control Problems 100%
• Polynomial 100%
• Upper Bound 100%
• Permutation 100%
• Running Time 100%
• Computational Effort 100%
• Earliest Time 100%