Optimal due date assignment in multi-machine scheduling environments

Keyphrases

• Due Date Assignment 100%
• Multi-machine Scheduling 100%
• Due Date 50%
• High Cost 25%
• NP-hard 25%
• Assignment Problem 25%
• First Problem 25%
• Cost Function 25%
• Earliness-tardiness 25%
• Polynomial Time Solution 25%
• Parallel Machine Problem 25%
• Non-approximability 25%
• Number of Tardy Jobs 25%

Mathematics

• Minimizes 100%
• Polynomial Time 50%
• Objective Function 50%
• Approximability 50%
• Cost Function 50%