Pages that link to "Item:Q329086"
From MaRDI portal
The following pages link to Minimization of the maximal lateness for a single machine (Q329086):
Displaying 3 items.
- Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem (Q1673705) (← links)
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times (Q2066683) (← links)
- Fast solution of single-machine scheduling problem with embedded jobs (Q2420645) (← links)
