2016
DOI: 10.1016/j.ifacol.2016.07.834
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Approaches to Scheduling for Unrelated Parallel Machines with Release Dates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…Therefore, promising direction for further work is more accurate adaptation of the algorithm to the problem of distribution of the customer support tasks. That is, to take into account the possibility of parallel execution of tasks by programmers [17][18][19][20], the priority of tasks, as well as the priority of the programmer for the task. The latter means the priority of a certain programmer in distribution of the subscriber tasks: the programmer who implemented the web project has a higher priority in the queue for subscriber tasks from this project.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, promising direction for further work is more accurate adaptation of the algorithm to the problem of distribution of the customer support tasks. That is, to take into account the possibility of parallel execution of tasks by programmers [17][18][19][20], the priority of tasks, as well as the priority of the programmer for the task. The latter means the priority of a certain programmer in distribution of the subscriber tasks: the programmer who implemented the web project has a higher priority in the queue for subscriber tasks from this project.…”
Section: Resultsmentioning
confidence: 99%
“…[13,17], [20,24], [29, + ∞). The idle periods I 4 for the fourth programmer m 4 are [0.5], [10,12], [16,22], [31, + ∞).…”
Section: Test Case With 4 Programmersmentioning
confidence: 99%