The minimization of exact total weighted completion time in the preemptive scheduling problem by subsequent length-equal job importance growth
For the preemptive scheduling problem in case of subsequent job importance growth, it is studied whether the optimal schedule might be found faster within an exact model. It is ascertained that when the number of jobs up to six (except for the case of four jobs) and there is no randomness in problem...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
V. N. Karazin Kharkiv National University
2018-11-01
|
| Series: | Вісник Харківського національного університету імені В.Н. Каразіна. Серія: Математичне моделювання, інформаційні технології, автоматизовані системи управління |