Pages that link to "Item:Q1806278"
From MaRDI portal
The following pages link to On polynomial solvability of two multiprocessor scheduling problems (Q1806278):
Displaying 6 items.
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs (Q1326784) (← links)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (Q2456409) (← links)
- A polynomial algorithm for one problem of guillotine cutting (Q2465953) (← links)
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (Q2931828) (← links)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)