| Article ID: | iaor1998897 |
| Country: | Netherlands |
| Volume: | 79 |
| Issue: | 2 |
| Start Page Number: | 167 |
| End Page Number: | 175 |
| Publication Date: | Dec 1994 |
| Journal: | European Journal of Operational Research |
| Authors: | Levner E.V., Nemirovsky A.S. |
| Keywords: | production: JIT |
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.