Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

Keyphrases

• Tardy Jobs 100%
• Common Due Window 100%
• Two-machine Flow Shop Scheduling 100%
• Structural Properties 50%
• Dynamic Programming Algorithm 50%
• Scheduling Problem 50%
• Rule Rule 50%
• Rule-based 50%
• Two-machine Flow Shop 50%
• NP-hard 50%
• Pseudo-polynomial 50%
• Search Space 50%
• Scheduling Model 50%
• Window Position 50%
• Window Size 50%
• Sequencing Rules 50%
• Elimination Rule 50%
• Dominance Property 50%
• Due Window Scheduling 50%
• Optimality Property 50%

Computer Science

• Scheduling Problem 100%
• Dynamic Programming Algorithm 100%
• Search Space 100%
• Flowshop Scheduling 100%
• Elimination Rule 100%