Pages that link to "Item:Q884466"
From MaRDI portal
The following pages link to Semi-online scheduling problems on two identical machines with inexact partial information (Q884466):
Displaying 7 items.
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Semi-online scheduling with known partial information about job sizes on two identical machines (Q551204) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Algorithms and Computation (Q5897875) (← links)
