A preemptive single-machine scheduling problem with a late work criterion and convex resource consumption functions

Key Points

• This research aims to optimize scheduling by minimizing late work and managing resource consumption effectively.
• Analyzed two single-machine scheduling problems with late work criterion
• Explored processing times as decreasing convex functions of resource consumption
• Developed preemptive scheduling strategies that allow job interruptions and resumptions
• Demonstrated solutions for both scheduling problems can be achieved in strongly polynomial time
• Achieved significant reductions in both late work and resource consumption through proposed methods