Pages that link to "Item:Q1917354"
From MaRDI portal
The following pages link to Restrictions and preassignments in preemptive open shop scheduling (Q1917354):
Displaying 19 items.
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- The combinatorics of timetabling (Q1278524) (← links)
- What is my objective function? (Q1278819) (← links)
- On a multiconstrained model for chromatic scheduling (Q1293198) (← links)
- On perfectness of sums of graphs (Q1296974) (← links)
- Restricted coloring models for timetabling (Q1356739) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations (Q1399253) (← links)
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Open shop scheduling with some additional constraints (Q1911243) (← links)
- Improved approximation algorithms for the max edge-coloring problem (Q1944142) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Bounded colouring motivated by the limited resource partially concurrent open shop problem (Q2241155) (← links)
- A preemptive open shop scheduling problem with one resource (Q2641218) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- Nonpreemptive open shop with restricted processing times (Q4296296) (← links)
