TY - JOUR
T1 - A network flow algorithm for just-in-time project scheduling
AU - Levner, E. V.
AU - Nemirovsky, A. S.
PY - 1994/12/8
Y1 - 1994/12/8
N2 - We consider a project scheduling problem with the objective being a piecewise-linear, convex (possibly, non-monotone) function of the job durations as well as of job start/finish times. A version of 'out-of-kilter' algorithm of pseudo-linear complexity to handle this problem is provided.
AB - We consider a project scheduling problem with the objective being a piecewise-linear, convex (possibly, non-monotone) function of the job durations as well as of job start/finish times. A version of 'out-of-kilter' algorithm of pseudo-linear complexity to handle this problem is provided.
KW - Just-in-time scheduling
KW - Out-of-kilter method
KW - Project scheduling
KW - Pseudo-polynomial algorithm
UR - http://www.scopus.com/inward/record.url?scp=0042524250&partnerID=8YFLogxK
U2 - 10.1016/0377-2217(94)90348-4
DO - 10.1016/0377-2217(94)90348-4
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0042524250
SN - 0377-2217
VL - 79
SP - 167
EP - 175
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 2
ER -