Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems

Keyphrases

• Two-machine 100%
• Machine Scheduling 100%
• Just-in-time Job 100%
• Scheduling System 100%
• Pseudo-polynomial Time Algorithm 25%
• FPTAS 25%
• Pseudo-polynomial Algorithm 25%
• Two-machine Flow Shop Scheduling 25%
• Job Shop Scheduling 25%
• Open Shop Scheduling 25%

Computer Science

• Just-in-Time 100%
• polynomial-time algorithm 50%
• Scheduling Problem 50%
• Flowshop Scheduling 50%
• Fully Polynomial-Time Approximation Scheme 50%
• Polynomial Algorithm 50%