Pages that link to "Item:Q813963"
From MaRDI portal
The following pages link to On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963):
Displaying 12 items.
- The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm (Q967432) (← links)
- Scheduling unit-length jobs with precedence constraints of small height (Q1667212) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
- Machine scheduling with soft precedence constraints (Q2282538) (← links)
- Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
- Stochastic project scheduling with hierarchical alternatives (Q2295321) (← links)
- Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- Approximation and Online Algorithms (Q5896927) (← links)
- Vertex ordering with precedence constraints (Q6546603) (← links)