The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost

Mathematics

• Batch Scheduling 100%
• Batching 31%
• Costs 45%
• First Variation 27%
• FPTAS 30%
• Minimise 49%
• NP-complete problem 32%
• NP-hard Problems 23%
• Pareto Optimal Solution 28%
• Polynomial time 16%
• Polynomial-time Algorithm 18%
• Rejection 71%
• Scheduling Problem 63%
• Single Machine 78%
• Total Completion Time 90%
• Upper bound 13%

Business & Economics

• Batch 63%
• Batching 21%
• Costs 23%
• NP-hard 49%
• Optimal Solution 13%
• Polynomial-time Algorithm 19%
• Polynomials 15%
• Scheduling Problem 56%
• Serials 67%
• Single Machine 70%
• Total Completion Time 83%
• Upper Bound 15%

Engineering & Materials Science

• Costs 23%
• NP-hard 60%
• Polynomials 32%
• Scheduling 42%