A unified approach for single machine scheduling with position-dependent workloads and positional penalties

In this paper, we provide unified methods for solving scheduling problems with convex resource allocation, concentrating on objective functions that can be expressed as a scalar product of the actual processing times vector and a job-independent and position-dependent penalties vector. We assume general position-dependent workloads, i.e., the workloads are not restricted to be either monotone functions of the job positions or to specific functions. The first unified method focuses on minimizing a scheduling measure subject to a constraint on the resource consumption, whereas the second addresses the complementary problem of minimizing the consumed resource given an upper bound on the scheduling measure. For each unified approach, we provide a methodical analysis and consequently provide a On3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O\left( {n^{3} } \right)$$\end{document} solution algorithm. Furthermore, to demonstrate the unified schemes, we solve several scheduling measures that involve earliness and tardiness penalties.