Abstract: This paper considers sequencing situations with non-linear cost functions under optimal order consistency. Specifically, we study sequencing situations with discounting cost functions and logarithmic cost functions of the completion time. In both settings, we show that the neighbor switching gains are non-negative and non-decreasing for every misplaced pair of players. We derive new conditions on the time-dependent neighbor switching gains in a sequencing situation under optimal order consistency to guarantee convexity of the associated sequenc...
(read more)
Topics: 
Mathematical optimization