On project scheduling with irregular starting time costs

Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Jochen Uetz

Research output: Contribution to journalArticleAcademicpeer-review

38 Citations (Scopus)


Maniezzo and Mingozzi (Oper. Res. Lett. 25 (1999) 175–182) study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure and they identify special cases that are solvable in polynomial time. In this note, we present a collection of previously established results which show that the general problem is solvable in polynomial time. This collection may serve as a useful guide to the literature, since this polynomial-time solvability has been rediscovered in different contexts or using different methods. In addition, we briefly review some related results for specializations and generalizations of the problem.
Original languageUndefined
Article number10.1016/S0167-6377(01)00064-5
Pages (from-to)149-154
Number of pages6
JournalOperations research letters
Issue number4
Publication statusPublished - May 2001


  • EWI-13114
  • IR-62399

Cite this