ACCURACY OF A HEURISTIC FOR TOTAL WEIGHTED COMPLETION TIME MINIMIZATION IN PREEMPTIVE SINGLE MACHINE SCHEDULING PROBLEM BY NO IDLE TIME INTERVALS
Background. A special case of the job scheduling process is that when jobs are processed on a single machine, preemptions are allowed, and there are no idle time intervals. Despite the exact solution models are always much slower than the heuristics, laws of heuristic’s rapidness advantage and heuri...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Igor Sikorsky Kyiv Polytechnic Institute
2019-05-01
|
| Series: | KPI Science News |
| Subjects: | |
| Online Access: | http://scinews.kpi.ua/article/view/164804 |