A heuristic solution procedure to minimize makespan on a single machine with non-linear cost functions

The paper considers the static single-facility scheduling problem where the processing times of jobs are a nondecreasing and differentiable function of their starting (waiting) times and the objective is to minimize the total elapsed time (makespan) in which all jobs complete their processing. It gives a criterion for optimality of two jobs to be scheduled next to each other, and based on this criterion, proposes a heuristic algorithm to solve the problem. The effectiveness of the algorithm is empirically evaluated for quadratic and exponential cost functions. In the quadratic case it is compared with the static heuristic algorithm proposed by Gupta and Gupta.