Complexity Results for Single Machine Distance Constrained Scheduling Problems
| dc.contributor.author | Engels, Daniel W. | en_US |
| dc.contributor.author | Karger, David | en_US |
| dc.contributor.author | Devadas, Srinivas | en_US |
| dc.date.accessioned | 2023-03-29T14:41:11Z | |
| dc.date.available | 2023-03-29T14:41:11Z | |
| dc.date.issued | 1998-11 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149283 | |
| dc.description.abstract | Scheduling problems that involve timing constraints between tasks occur often in machine shop scheduling (e.g., job shop scheduling problems) and code scheduling during software compilation for pipelined processors (e.g., multiprocessor sequencing and scheduling problems). | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-587 | |
| dc.title | Complexity Results for Single Machine Distance Constrained Scheduling Problems | en_US |
