Pages that link to "Item:Q2784175"
From MaRDI portal
The following pages link to Mixed graph coloring for unit-time job-shop scheduling (Q2784175):
Displaying 15 items.
- Coloring some classes of mixed graphs (Q858294) (← links)
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- Minimizing makespan for multi-spindle head machines with a mobile table (Q954031) (← links)
- A note on mixed tree coloring (Q963351) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- Parameterized mixed graph coloring (Q2424815) (← links)
- On two coloring problems in mixed graphs (Q2426450) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
- (Q5863594) (← links)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times (Q6669643) (← links)
