Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. LCS Publications
  4. LCS Technical Memos (1974 - 2003)
  5. Complexity Results for Single Machine Distance Constrained Scheduling Problems

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
https://hdl.handle.net/1721.1/149283
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.