Pages that link to "Item:Q2275933"
From MaRDI portal
The following pages link to Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933):
Displaying 5 items.
- Task assignment with controlled and autonomous agents (Q459176) (← links)
- The resource dependent assignment problem with a convex agent cost function (Q1753596) (← links)
- A pseudo-polynomial time algorithm for solving the resource dependent assignment problem (Q2255050) (← links)
- The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions (Q2890420) (← links)
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation (Q5059190) (← links)