A Note on Scheduling Problems with Irregular Starting Time Costs
Author(s)Schulz, Andreas S.; Möhring, Rolf H.; Stork, Frederik; Uetz, Marc
In , Maniezzo and Mingozzi 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 identify special cases that are solvable in polynomial time. In this note, we review three previously established, related results which show that the general problem is solvable in polynomial time.
Massachusetts Institute of Technology, Operations Research Center
Operations Research Center Working Paper;OR 347-00