Pages that link to "Item:Q858768"
From MaRDI portal
The following pages link to Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768):
Displayed 8 items.
- Fuzzy colouring of fuzzy graphs (Q258334) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem (Q2336703) (← links)
- Parameterized mixed graph coloring (Q2424815) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)
- (Q6106851) (← links)