We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Complexity Results for Single Machine Distance Constrained Scheduling Problems

Thumbnail Image
Download
Name

MIT-LCS-TM-587.pdf

Size

1.48 MB

Format

Adobe PDF

Checksum (MD5)

6972c5438c3d82112376dc3ec7d15b18

Author(s)
Engels, Daniel W.
•
Karger, David
•
Devadas, Srinivas
Date Issued
November 1998
Series/Report no.
MIT-LCS-TM-587
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).
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.