Pages that link to "Item:Q3157382"
From MaRDI portal
The following pages link to Two-machine open shop scheduling with special transportation times (Q3157382):
Displaying 17 items.
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) (← links)
- Two-machine interval shop scheduling with time lags (Q892834) (← links)
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (Q1043332) (← links)
- A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581) (← links)
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (Q1779528) (← 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)
- A memetic algorithm for the job-shop with time-lags (Q2468490) (← links)
- The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
- On-line two-machine open shop scheduling with time lags (Q2654315) (← links)
- Transporting jobs through a two‐machine open shop (Q3621908) (← links)
- (Q3832310) (← links)
- On the complexity of open shop scheduling with time lags (Q6173710) (← links)
- Reentrant open shop scheduling problem with time lags and no-wait constraints (Q6568390) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
