The following pages link to (Q4517279):
Displaying 7 items.
- Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources (Q278540) (← links)
- On the calendar planning problem with renewable resource (Q461985) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- On scheduling credited projects (Q2261744) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- Construction of cyclic schedules in presence of parallel machines (Q2984968) (← links)
- On some implementations of solving the resource constrained project scheduling problems (Q3388406) (← links)
