A Note on Scheduling Problems with Irregular Starting Time Costs
Name
OR-347-00.pdf
Size
392.14 KB
Format
Adobe PDF
Checksum (MD5)
555ecdeb8425ec09479fcb4851ce7dcf
Author(s)
Schulz, Andreas S.
Möhring, Rolf H.
Stork, Frederik
Uetz, Marc
Date Issued
February 2000
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 347-00
Abstract
In [9], 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.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
