Citations of this article
Mendeley users who have this article in their library.
Get full text


We consider a single-machine scheduling problem in which due dates are linear functions of the job waiting-times and the objective is to minimize the maximum lateness. An optimal sequence is constructed by implementing an index-based priority rule for a fixed value of the due date normalizing constant k. We determine in polynomial time all the k value ranges so that the optimal sequence remains the same within each range. The optimal due dates are computed as linear functions of the global optimal value of k. The overall procedure is illustrated in a numerical example. © 2007 Elsevier B.V. All rights reserved.




Koulamas, C., & Kyparisis, G. J. (2008). Single-machine scheduling with waiting-time-dependent due dates. European Journal of Operational Research, 191(2), 576–580. https://doi.org/10.1016/j.ejor.2007.08.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free