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

Levner, E.V. & Nemirovsky, A.S. (1994). A network flow algorithm for just-in-time project scheduling. European Journal of Operational Research 79 (2) 167-175. 10.1016/0377-2217(94)90348-4.

Full text not available from this repository.

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	Project scheduling; Just-in-time scheduling; Out-of-kilter method; Pseudo-polynomial algorithm
Research Programs:	Methodology of Decision Analysis (MDA)
Bibliographic Reference:	European Journal of Operational Research; 79:167-175 [1994]
Depositing User:	IIASA Import
Date Deposited:	15 Jan 2016 02:03
Last Modified:	27 Aug 2021 17:35
URI:	https://pure.iiasa.ac.at/3883

Actions (login required)

View Item