Pages that link to "Item:Q3621908"
From MaRDI portal
The following pages link to Transporting jobs through a two‐machine open shop (Q3621908):
Displayed 9 items.
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553) (← links)
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) (← links)
- Preemptive scheduling on two identical parallel machines with a single transporter (Q1944394) (← 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)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
- On a routing Open Shop Problem on two nodes with unit processing times (Q5090158) (← links)
- Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs (Q5348802) (← links)