Single facility sequencing with variable processing times and costs

Abstract

The classical single facility job sequencing problem is considered where the processing cost is a quadratic function of the processing time. Jobs also incur a delay cost based on the residence time in the facility. The algorithm developed enables the finding of the optimal sequence and processing times that minimizes total cost.