Pages that link to "Item:Q2450763"
From MaRDI portal
The following pages link to Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem (Q2450763):
Displaying 8 items.
- Online integrated production-distribution scheduling problems without preemption (Q281801) (← links)
- On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost (Q319441) (← links)
- On-line supply chain scheduling problems with preemption (Q872299) (← links)
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines (Q1617275) (← links)
- Competitive algorithms for multistage online scheduling (Q1753459) (← links)
- Semi-online two-level supply chain scheduling problems (Q2434290) (← links)
- (Q3538316) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)