Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints

Abstract

In this work we combine resource augmentation and alpha-point scheduling techniques, which have resulted in very good performance scheduling algorithms, to compute approximate solutions for a general family of scheduling problems: each job has a convex non-decreasing cost function and the goal is to compute a schedule that minimizes the total cost subject… (More)
DOI: 10.1016/j.orl.2013.05.008

5 Figures and Tables

Topics

  • Presentations referencing similar topics