Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

Business & Economics

• Batching 90%
• Processing Time 69%
• Heuristics 51%
• Makespan 36%
• Upper Bound 16%
• Approximation Algorithms 10%
• Lower Bounds 8%
• Polynomials 7%
• Scheduling Problem 7%
• Problem Solving 7%
• Optimal Solution 7%
• Schedule 6%
• Experiment 4%
• Performance 3%

Mathematics

• Batching 100%
• Scheduling 66%
• Heuristics 56%
• Upper bound 10%
• Schedule 8%
• Scheduling Problem 8%
• Exceed 7%
• Polynomial-time Algorithm 7%
• Approximation Algorithms 7%
• Optimal Solution 6%
• Evaluate 6%
• Minimise 6%
• Tend 6%
• Lower bound 5%
• Demonstrate 4%
• Performance 4%

Engineering & Materials Science

• Scheduling 44%
• Approximation algorithms 11%
• Polynomials 8%
• Set theory 6%
• Experiments 3%