2014
DOI: 10.1504/ijise.2014.060658
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Pareto-optimal group scheduling for a single machine

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…In problems with the average utility criterion V there is an additional condition of start due date i g (Mauergauz, 2014). Since the number of solution-selecting conditions, which are possible at each step, is equal to 2, the number of such solutions (tree nodes) may be more than 1.…”
Section: Problem Formulation and Its Solution Algorithmmentioning
confidence: 99%
“…In problems with the average utility criterion V there is an additional condition of start due date i g (Mauergauz, 2014). Since the number of solution-selecting conditions, which are possible at each step, is equal to 2, the number of such solutions (tree nodes) may be more than 1.…”
Section: Problem Formulation and Its Solution Algorithmmentioning
confidence: 99%