Pages that link to "Item:Q1686066"

The following pages link to Graph multi-coloring for a job scheduling application (Q1686066):

Displaying 6 items.

• Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
• Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
• Chromatic polynomial of intuitionistic fuzzy graphs using \(\left( \alpha, \beta\right)\)-levels (Q2081893) (← links)
• Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times (Q2124913) (← links)
• Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study (Q6071074) (← links)
• Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem (Q6092613) (← links)