A Note on Scheduling Problems with Irregular Starting Time Costs
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...
| Main Authors: | , , , |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Online Access: | http://hdl.handle.net/1721.1/5402 |
| _version_ | 1826216981390426112 |
|---|---|
| author | Schulz, Andreas S. Möhring, Rolf H. Stork, Frederik Uetz, Marc |
| author_facet | Schulz, Andreas S. Möhring, Rolf H. Stork, Frederik Uetz, Marc |
| author_sort | Schulz, Andreas S. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T16:56:15Z |
| format | Working Paper |
| id | mit-1721.1/5402 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T16:56:15Z |
| publishDate | 2004 |
| publisher | Massachusetts Institute of Technology, Operations Research Center |
| record_format | dspace |
| spelling | mit-1721.1/54022019-04-10T10:36:20Z A Note on Scheduling Problems with Irregular Starting Time Costs Schulz, Andreas S. Möhring, Rolf H. Stork, Frederik Uetz, Marc 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. 2004-06-01T16:42:54Z 2004-06-01T16:42:54Z 2000-02 Working Paper http://hdl.handle.net/1721.1/5402 en_US Operations Research Center Working Paper;OR 347-00 401550 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center |
| spellingShingle | Schulz, Andreas S. Möhring, Rolf H. Stork, Frederik Uetz, Marc A Note on Scheduling Problems with Irregular Starting Time Costs |
| title | A Note on Scheduling Problems with Irregular Starting Time Costs |
| title_full | A Note on Scheduling Problems with Irregular Starting Time Costs |
| title_fullStr | A Note on Scheduling Problems with Irregular Starting Time Costs |
| title_full_unstemmed | A Note on Scheduling Problems with Irregular Starting Time Costs |
| title_short | A Note on Scheduling Problems with Irregular Starting Time Costs |
| title_sort | note on scheduling problems with irregular starting time costs |
| url | http://hdl.handle.net/1721.1/5402 |
| work_keys_str_mv | AT schulzandreass anoteonschedulingproblemswithirregularstartingtimecosts AT mohringrolfh anoteonschedulingproblemswithirregularstartingtimecosts AT storkfrederik anoteonschedulingproblemswithirregularstartingtimecosts AT uetzmarc anoteonschedulingproblemswithirregularstartingtimecosts AT schulzandreass noteonschedulingproblemswithirregularstartingtimecosts AT mohringrolfh noteonschedulingproblemswithirregularstartingtimecosts AT storkfrederik noteonschedulingproblemswithirregularstartingtimecosts AT uetzmarc noteonschedulingproblemswithirregularstartingtimecosts |