A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence

Keyphrases

• Due Date 100%
• Job Sequencing 100%
• Just-in-time Job 100%
• Polynomial Time 50%
• Solution Algorithm 50%
• Pseudo-polynomial 50%
• Single Machine Scheduling Problem 50%
• Polynomially Solvable 50%
• Dynamic Programming Algorithm 50%
• Time Dynamics 50%
• True Density 50%
• Polynomial Solutions 50%
• Two-machine Flow Shop 50%
• Large Instances 50%

Computer Science

• Just-in-Time 100%
• Polynomial Time 50%
• Dynamic Programming Algorithm 50%
• single machine scheduling problem 50%
• Polynomial Solution 50%

Mathematics

• Running Time 100%
• Polynomial Time 50%
• Single Machine 50%
• Polynomial Solution 50%