Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints
It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NP- hard. Du and Leung solved some special cases by the generalized Baker's algorithm and the generalized Smith's algorithm in O(n2) time. In...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2014-02-01
|
| Series: | Foundations of Computing and Decision Sciences |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/fcds.2014.39.issue-1/fcds-2014-0002/fcds-2014-0002.xml?format=INT |