A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion

2021/05/11 by Susumu Hashimoto, Hashimoto, Susumu, Shinji Mizuno +1
Engineering · Computer Science · #Scheduling and Optimization Algorithms #Optimization and Search Problems #Advanced Manufacturing and Logistics Optimization

paper · pdf · doi:10.48550/arxiv.2105.04735

Abstract

This paper studies a single-machine scheduling problem with a non-renewable resource (NR-SSP) and total weighted completion time criterion. The non-renewable resource is consumed when the machine starts processing a job. We consider the case where each job's weight in the objective function is proportional to its resource consumption amount. The problem is known to be NP-hard in this case. We propose a 3-approximation list scheduling algorithm for this problem. Besides, we show that the approximation ratio 3 is tight for the algorithm.

Related

• Scheduling with Non-Renewable Resources: Minimizing the Sum of Completion Times
• New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
• Minimum total weighted completion time: Faster approximation schemes
• Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
• Closing the gap for single resource constraint scheduling