Pages that link to "Item:Q872299"
From MaRDI portal
The following pages link to On-line supply chain scheduling problems with preemption (Q872299):
Displaying 14 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)
- Integrated scheduling of production and delivery on a single machine with availability constraint (Q476906) (← links)
- On-line integrated production-distribution scheduling problems with capacitated deliveries (Q1042489) (← links)
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines (Q1617275) (← links)
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs (Q1698887) (← links)
- Integrated scheduling of production and distribution with release dates and capacitated deliveries (Q1793780) (← links)
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan (Q2257290) (← links)
- Semi-online two-level supply chain scheduling problems (Q2434290) (← links)
- Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem (Q2450763) (← links)
- Coordination of production and transportation in supply chain scheduling (Q2514664) (← links)
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178) (← links)
- Preemptive scheduling in a two-stage supply chain to minimize the makespan (Q3458814) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)
