Pages that link to "Item:Q3125964"
From MaRDI portal
The following pages link to Scheduling problem: complexity analysis and polynomially solvable subclasses (Q3125964):
Displaying 9 items.
- Models and optimization problems for single-processor servicing of packets of objects (Q510292) (← links)
- Optimal servicing strategy design problems for stationary objects in a one-dimensional working zone of a processor (Q612209) (← links)
- A note on `Efficient scheduling of periodic information monitoring requests' (Q1044176) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- Polynomial algorithms of solution for some problems of construction of the timetables of a device for demands with waiting (Q2818881) (← links)
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (Q2931828) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- (Q4527315) (← links)
- (Q4866315) (← links)