Pages that link to "Item:Q3985537"
From MaRDI portal
The following pages link to Compact Cylindrical Chromatic Scheduling (Q3985537):
Displaying 16 items.
- Interval cyclic edge-colorings of graphs (Q279196) (← links)
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- A generalization of interval edge-colorings of graphs (Q602763) (← links)
- The cyclic compact open-shop scheduling problem (Q686491) (← links)
- Compact scheduling of zero-one time operations in multi-stage systems (Q705502) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- Some complexity results in cyclic scheduling (Q1341404) (← links)
- Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs (Q1690222) (← links)
- Chromatic scheduling in a cyclic open shop (Q1767677) (← links)
- Open shop scheduling with some additional constraints (Q1911243) (← links)
- Cyclic deficiency of graphs (Q2026336) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Compact cyclic edge-colorings of graphs (Q2427500) (← links)
- Chromatic scheduling (Q2822599) (← links)
- (Q5204003) (← links)
- A family of multigraphs with large palette index (Q5217064) (← links)