Minmax common due-window assignment and scheduling on a single machine with two competing agents

Keyphrases

• Competitive Agents 100%
• Common Due Window 100%
• Due-window Assignment 100%
• Single Machine 100%
• Due Date 100%
• Min-max 100%
• Scheduler 100%
• Due Window Scheduling 100%
• Two-agent 50%
• Assignment Problem 50%
• Multi-agent Problems 50%
• Multi-agent 50%
• Earliness-tardiness 50%
• B-type 50%
• Due Date Assignment 50%
• Common Due Date Assignment 50%
• Maximum Cost 50%
• Job Sequencing 50%
• Polynomial Time Solution 50%
• Agent Scheduling 50%
• A-type 50%
• Total Earliness 50%

Mathematics

• Minimizes 100%
• Single Machine 100%
• Upper Bound 66%
• Objective Function 33%
• Polynomial Time 33%
• Classical Method 33%