Pages that link to "Item:Q387811"
From MaRDI portal
The following pages link to Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811):
Displaying 9 items.
- Integrated production-distribution scheduling problem with multiple independent manufacturers (Q1666043) (← links)
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery (Q2176828) (← links)
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
- Two faster algorithms for coordination of production and batch delivery: a note (Q2629739) (← links)
- Transporting jobs through a two‐machine open shop (Q3621908) (← links)
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074) (← links)
- Flow shop scheduling problems with transportation constraints revisited (Q6185848) (← links)
