Pages that link to "Item:Q1383798"
From MaRDI portal
The following pages link to On-line scheduling of two-machine open shops where jobs arrive over time (Q1383798):
Displaying 8 items.
- A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146) (← links)
- An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
- A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← 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)
- Non-clairvoyant weighted flow time scheduling on different multi-processor models (Q2344210) (← links)
- Utilization of nonclairvoyant online schedules (Q2508980) (← links)
- On-line two-machine open shop scheduling with time lags (Q2654315) (← links)