A network flow algorithm for just-in-time project scheduling

E. V. Levner, A. S. Nemirovsky

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


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.

Original languageEnglish
Pages (from-to)167-175
Number of pages9
JournalEuropean Journal of Operational Research
Issue number2
StatePublished - 8 Dec 1994
Externally publishedYes


  • Just-in-time scheduling
  • Out-of-kilter method
  • Project scheduling
  • Pseudo-polynomial algorithm


Dive into the research topics of 'A network flow algorithm for just-in-time project scheduling'. Together they form a unique fingerprint.

Cite this