Tube-tap or Earliest Due Date : What happens when all jobs cannot be completed?
In this thesis the scheduling algorithms Earliest Due Date (EDD) and Tube-tap were compared to each other. They were compared to see which algorithm generated more net profit. They were compared to each other in four different scenarios. In each scenario there were two different machines and five di...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Umeå universitet, Institutionen för datavetenskap
2021
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-184627 |