Pages that link to "Item:Q1376266"
From MaRDI portal
The following pages link to A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) (Q1376266):
Displaying 7 items.
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- A scheme of approximation solution of problem 1 |r j|L max (Q3115616) (← links)
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION (Q3646206) (← links)
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem (Q4294730) (← links)