Pages that link to "Item:Q968014"
From MaRDI portal
The following pages link to An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014):
Displaying 5 items.
- On-line scheduling of two-machine open shops where jobs arrive over time (Q1383798) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- On-line two-machine open shop scheduling with time lags (Q2654315) (← links)
- Tighter bounds on preemptive job shop scheduling with two machines (Q5947304) (← links)